Base | Representation |
---|---|
bin | 111100010010010010… |
… | …000001110011100000 |
3 | 20012002020012221202100 |
4 | 330102102001303200 |
5 | 2030032143202222 |
6 | 45423114450400 |
7 | 4451046223335 |
oct | 742222016340 |
9 | 205066187670 |
10 | 64731225312 |
11 | 254a80a8726 |
12 | 10666433a00 |
13 | 6147a018b0 |
14 | 31c0d8c98c |
15 | 1a3ccb74ac |
hex | f12481ce0 |
64731225312 has 288 divisors, whose sum is σ = 215581347072. Its totient is φ = 18238390272.
The previous prime is 64731225287. The next prime is 64731225331. The reversal of 64731225312 is 21352213746.
64731225312 is a `hidden beast` number, since 6 + 4 + 7 + 312 + 25 + 312 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2341233 + ... + 2368719.
It is an arithmetic number, because the mean of its divisors is an integer number (748546344).
Almost surely, 264731225312 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 64731225312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107790673536).
64731225312 is an abundant number, since it is smaller than the sum of its proper divisors (150850121760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64731225312 is a wasteful number, since it uses less digits than its factorization.
64731225312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27570 (or 27559 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
The spelling of 64731225312 in words is "sixty-four billion, seven hundred thirty-one million, two hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •