Base | Representation |
---|---|
bin | 11101001011001101100000… |
… | …10101000100010101101001 |
3 | 22102011100010121112110220222 |
4 | 32211212300111010111221 |
5 | 31402121300003010121 |
6 | 344241133242255425 |
7 | 16341116262025430 |
oct | 1645466025042551 |
9 | 272140117473828 |
10 | 64156884813161 |
11 | 19495866a01958 |
12 | 724204aab7575 |
13 | 29a4c783cc0ca |
14 | 11bb2d195c117 |
15 | 763d03ca20ab |
hex | 3a59b0544569 |
64156884813161 has 8 divisors (see below), whose sum is σ = 73533457112640. Its totient is φ = 54833138273808.
The previous prime is 64156884813113. The next prime is 64156884813187. The reversal of 64156884813161 is 16131848865146.
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 64156884813161 - 214 = 64156884796777 is a prime.
It is a super-2 number, since 2×641568848131612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64156884813094 and 64156884813103.
It is not an unprimeable number, because it can be changed into a prime (64156884813061) 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, 13206437426 + ... + 13206442283.
It is an arithmetic number, because the mean of its divisors is an integer number (9191682139080).
Almost surely, 264156884813161 is an apocalyptic number.
It is an amenable number.
64156884813161 is a deficient number, since it is larger than the sum of its proper divisors (9376572299479).
64156884813161 is a wasteful number, since it uses less digits than its factorization.
64156884813161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26412880063.
The product of its digits is 26542080, while the sum is 62.
The spelling of 64156884813161 in words is "sixty-four trillion, one hundred fifty-six billion, eight hundred eighty-four million, eight hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •