Base | Representation |
---|---|
bin | 111100000000111010… |
… | …011101010101000000 |
3 | 20011022220220201220120 |
4 | 330000322131111000 |
5 | 2023433044141140 |
6 | 45334145140240 |
7 | 4440610356630 |
oct | 740072352500 |
9 | 204286821816 |
10 | 64439833920 |
11 | 25368673aa0 |
12 | 105a492a680 |
13 | 60cc529257 |
14 | 31943ba6c0 |
15 | 1a224091d0 |
hex | f00e9d540 |
64439833920 has 896 divisors, whose sum is σ = 268206833664. Its totient is φ = 12718080000.
The previous prime is 64439833901. The next prime is 64439833937. The reversal of 64439833920 is 2933893446.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 139782490 + ... + 139782950.
It is an arithmetic number, because the mean of its divisors is an integer number (299337984).
Almost surely, 264439833920 is an apocalyptic number.
64439833920 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64439833920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134103416832).
64439833920 is an abundant number, since it is smaller than the sum of its proper divisors (203766999744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64439833920 is a wasteful number, since it uses less digits than its factorization.
64439833920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591 (or 581 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 51.
The spelling of 64439833920 in words is "sixty-four billion, four hundred thirty-nine million, eight hundred thirty-three thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •