Base | Representation |
---|---|
bin | 1001001010110111011111… |
… | …01110110100101110110011 |
3 | 2122101201100112121111121111 |
4 | 10211123233232310232303 |
5 | 10120334044210013114 |
6 | 110515253315334151 |
7 | 4150562356232122 |
oct | 445335756645663 |
9 | 78351315544544 |
10 | 20164598516659 |
11 | 6474838199893 |
12 | 231804b2b1357 |
13 | b3368a16b71c |
14 | 4d9d867a3ab9 |
15 | 24e7da3c1bc4 |
hex | 1256efbb4bb3 |
20164598516659 has 8 divisors (see below), whose sum is σ = 20336171387168. Its totient is φ = 19993686814080.
The previous prime is 20164598516653. The next prime is 20164598516677. The reversal of 20164598516659 is 95661589546102.
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 20164598516659 - 25 = 20164598516627 is a prime.
It is a super-2 number, since 2×201645985166592 (a number of 27 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 = 20164598516594 and 20164598516603.
It is not an unprimeable number, because it can be changed into a prime (20164598516653) 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, 165230727 + ... + 165352720.
It is an arithmetic number, because the mean of its divisors is an integer number (2542021423396).
Almost surely, 220164598516659 is an apocalyptic number.
20164598516659 is a deficient number, since it is larger than the sum of its proper divisors (171572870509).
20164598516659 is a wasteful number, since it uses less digits than its factorization.
20164598516659 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330583965.
The product of its (nonzero) digits is 139968000, while the sum is 67.
The spelling of 20164598516659 in words is "twenty trillion, one hundred sixty-four billion, five hundred ninety-eight million, five hundred sixteen thousand, six hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •