Base | Representation |
---|---|
bin | 1111101010001… |
… | …0010111000100 |
3 | 11120120201112212 |
4 | 3322202113010 |
5 | 113303123430 |
6 | 10303402552 |
7 | 1425146243 |
oct | 372422704 |
9 | 146521485 |
10 | 65676740 |
11 | 340889a8 |
12 | 19bb3458 |
13 | 107b6a9c |
14 | 8a1895a |
15 | 5b74b95 |
hex | 3ea25c4 |
65676740 has 12 divisors (see below), whose sum is σ = 137921196. Its totient is φ = 26270688.
The previous prime is 65676733. The next prime is 65676757. The reversal of 65676740 is 4767656.
65676740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 47969476 + 17707264 = 6926^2 + 4208^2 .
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1641899 + ... + 1641938.
It is an arithmetic number, because the mean of its divisors is an integer number (11493433).
Almost surely, 265676740 is an apocalyptic number.
It is an amenable number.
65676740 is an abundant number, since it is smaller than the sum of its proper divisors (72244456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65676740 is a wasteful number, since it uses less digits than its factorization.
65676740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283846 (or 3283844 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 41.
The square root of 65676740 is about 8104.1187059421. The cubic root of 65676740 is about 403.4631384826.
The spelling of 65676740 in words is "sixty-five million, six hundred seventy-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •