Base | Representation |
---|---|
bin | 11101001000010000111110… |
… | …00110111000111100101011 |
3 | 22101210122212101000010212002 |
4 | 32210020133012320330223 |
5 | 31343442000010333423 |
6 | 344122433232241215 |
7 | 16330604033431202 |
oct | 1644103706707453 |
9 | 271718771003762 |
10 | 64055664152363 |
11 | 19456944539284 |
12 | 72265003a020b |
13 | 2998566a43090 |
14 | 11b644c750239 |
15 | 76137c7ea228 |
hex | 3a421f1b8f2b |
64055664152363 has 8 divisors (see below), whose sum is σ = 68986801631328. Its totient is φ = 59125066487424.
The previous prime is 64055664152341. The next prime is 64055664152383. The reversal of 64055664152363 is 36325146655046.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 64055664152363 - 214 = 64055664135979 is a prime.
It is a super-2 number, since 2×640556641523632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64055664152299 and 64055664152308.
It is not an unprimeable number, because it can be changed into a prime (64055664152303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134707031 + ... + 135181712.
It is an arithmetic number, because the mean of its divisors is an integer number (8623350203916).
Almost surely, 264055664152363 is an apocalyptic number.
64055664152363 is a deficient number, since it is larger than the sum of its proper divisors (4931137478965).
64055664152363 is a wasteful number, since it uses less digits than its factorization.
64055664152363 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 269907013.
The product of its (nonzero) digits is 46656000, while the sum is 56.
The spelling of 64055664152363 in words is "sixty-four trillion, fifty-five billion, six hundred sixty-four million, one hundred fifty-two thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •