Base | Representation |
---|---|
bin | 111110010110011010… |
… | …000001110100111000 |
3 | 20101210201022110102210 |
4 | 332112122001310320 |
5 | 2044102131240224 |
6 | 50431102055120 |
7 | 4560013613562 |
oct | 762632016470 |
9 | 211721273383 |
10 | 66947915064 |
11 | 26435397528 |
12 | 10b8487a4a0 |
13 | 640c027a34 |
14 | 3351532332 |
15 | 1b1c6ce429 |
hex | f96681d38 |
66947915064 has 64 divisors (see below), whose sum is σ = 168450026400. Its totient is φ = 22172115456.
The previous prime is 66947915009. The next prime is 66947915117. The reversal of 66947915064 is 46051974966.
66947915064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 66947914995 and 66947915013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7423422 + ... + 7432434.
Almost surely, 266947915064 is an apocalyptic number.
It is an amenable number.
66947915064 is an abundant number, since it is smaller than the sum of its proper divisors (101502111336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66947915064 is a wasteful number, since it uses less digits than its factorization.
66947915064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10984 (or 10980 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 66947915064 in words is "sixty-six billion, nine hundred forty-seven million, nine hundred fifteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •