Base | Representation |
---|---|
bin | 11101011111001010110101… |
… | …10100110101011100100000 |
3 | 22111120220012102102211221101 |
4 | 32233211122310311130200 |
5 | 31444340214114130202 |
6 | 345524144440404144 |
7 | 16441504123020562 |
oct | 1657453264653440 |
9 | 274526172384841 |
10 | 64842645067552 |
11 | 1972a67a772950 |
12 | 7332b32776654 |
13 | 2a24834698071 |
14 | 12025879bd332 |
15 | 776a8cb6a887 |
hex | 3af95ad35720 |
64842645067552 has 192 divisors, whose sum is σ = 140494057441920. Its totient is φ = 29215162368000.
The previous prime is 64842645067469. The next prime is 64842645067561. The reversal of 64842645067552 is 25576054624846.
It is a super-3 number, since 3×648426450675523 (a number of 42 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18322305399 + ... + 18322308937.
It is an arithmetic number, because the mean of its divisors is an integer number (731739882510).
Almost surely, 264842645067552 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 64842645067552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70247028720960).
64842645067552 is an abundant number, since it is smaller than the sum of its proper divisors (75651412374368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64842645067552 is a wasteful number, since it uses less digits than its factorization.
64842645067552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4755 (or 4747 counting only the distinct ones).
The product of its (nonzero) digits is 387072000, while the sum is 64.
The spelling of 64842645067552 in words is "sixty-four trillion, eight hundred forty-two billion, six hundred forty-five million, sixty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •