Base | Representation |
---|---|
bin | 111011101101100000… |
… | …101000100010000000 |
3 | 20010111020100202011010 |
4 | 323231200220202000 |
5 | 2022301230000320 |
6 | 45241555520520 |
7 | 4426545350400 |
oct | 735540504200 |
9 | 203436322133 |
10 | 64114296960 |
11 | 2521093828a |
12 | 105138b9140 |
13 | 6079c59a2c |
14 | 316307a800 |
15 | 1a03a53ae0 |
hex | eed828880 |
64114296960 has 192 divisors, whose sum is σ = 237730273920. Its totient is φ = 14654674944.
The previous prime is 64114296949. The next prime is 64114296971. The reversal of 64114296960 is 6969241146.
It is an interprime number because it is at equal distance from previous prime (64114296949) and next prime (64114296971).
It is a tau number, because it is divible by the number of its divisors (192).
It is a super-2 number, since 2×641142969602 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 246664 + ... + 434823.
It is an arithmetic number, because the mean of its divisors is an integer number (1238178510).
Almost surely, 264114296960 is an apocalyptic number.
64114296960 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
64114296960 is an abundant number, since it is smaller than the sum of its proper divisors (173615976960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64114296960 is a wasteful number, since it uses less digits than its factorization.
64114296960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681523 (or 681504 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 48.
The spelling of 64114296960 in words is "sixty-four billion, one hundred fourteen million, two hundred ninety-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •