Base | Representation |
---|---|
bin | 111011101001101010… |
… | …011010100000000000 |
3 | 20010022201220112012102 |
4 | 323221222122200000 |
5 | 2022133214031224 |
6 | 45231332245532 |
7 | 4425132624014 |
oct | 735152324000 |
9 | 203281815172 |
10 | 64049752064 |
11 | 251884627a1 |
12 | 104b61708a8 |
13 | 606977b19c |
14 | 3158678544 |
15 | 19ed0544ae |
hex | ee9a9a800 |
64049752064 has 96 divisors (see below), whose sum is σ = 132338344320. Its totient is φ = 30974361600.
The previous prime is 64049751979. The next prime is 64049752087. The reversal of 64049752064 is 46025794046.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7702469 + ... + 7710779.
It is an arithmetic number, because the mean of its divisors is an integer number (1378524420).
Almost surely, 264049752064 is an apocalyptic number.
64049752064 is a gapful number since it is divisible by the number (64) 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 64049752064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66169172160).
64049752064 is an abundant number, since it is smaller than the sum of its proper divisors (68288592256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64049752064 is an equidigital number, since it uses as much as digits as its factorization.
64049752064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8457 (or 8437 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 47.
The spelling of 64049752064 in words is "sixty-four billion, forty-nine million, seven hundred fifty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •