Base | Representation |
---|---|
bin | 11101001000110010010101… |
… | …01010011100010011001000 |
3 | 22101212101002120222100220102 |
4 | 32210121022222130103020 |
5 | 31344240140114333142 |
6 | 344134554402544532 |
7 | 16332106625206100 |
oct | 1644311252342310 |
9 | 271771076870812 |
10 | 64073574761672 |
11 | 194634a5616133 |
12 | 7229a7a668148 |
13 | 299a15c5a5b58 |
14 | 11b726b34c200 |
15 | 761a79de7532 |
hex | 3a464aa9c4c8 |
64073574761672 has 96 divisors (see below), whose sum is σ = 140274534280320. Its totient is φ = 27357530820480.
The previous prime is 64073574761641. The next prime is 64073574761701. The reversal of 64073574761672 is 27616747537046.
It is a junction number, because it is equal to n+sod(n) for n = 64073574761599 and 64073574761608.
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, 573150422 + ... + 573262202.
It is an arithmetic number, because the mean of its divisors is an integer number (1461193065420).
Almost surely, 264073574761672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64073574761672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70137267140160).
64073574761672 is an abundant number, since it is smaller than the sum of its proper divisors (76200959518648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64073574761672 is a wasteful number, since it uses less digits than its factorization.
64073574761672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117251 (or 117240 counting only the distinct ones).
The product of its (nonzero) digits is 248935680, while the sum is 65.
The spelling of 64073574761672 in words is "sixty-four trillion, seventy-three billion, five hundred seventy-four million, seven hundred sixty-one thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •