Base | Representation |
---|---|
bin | 1001011001110111011000… |
… | …11111001100100111101000 |
3 | 2201012222112120211122200110 |
4 | 10230323230133030213220 |
5 | 10202310004140222242 |
6 | 111552122223334320 |
7 | 4233035124036510 |
oct | 454735437144750 |
9 | 81188476748613 |
10 | 20679940164072 |
11 | 665334a109032 |
12 | 239bab21513a0 |
13 | b70157855977 |
14 | 516cb3342840 |
15 | 25cdecd0339c |
hex | 12ceec7cc9e8 |
20679940164072 has 256 divisors, whose sum is σ = 62857451520000. Its totient is φ = 5545099929600.
The previous prime is 20679940164017. The next prime is 20679940164127. The reversal of 20679940164072 is 27046104997602.
It is an interprime number because it is at equal distance from previous prime (20679940164017) and next prime (20679940164127).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25178697 + ... + 25987047.
It is an arithmetic number, because the mean of its divisors is an integer number (245536920000).
Almost surely, 220679940164072 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 20679940164072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31428725760000).
20679940164072 is an abundant number, since it is smaller than the sum of its proper divisors (42177511355928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20679940164072 is a wasteful number, since it uses less digits than its factorization.
20679940164072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808544 (or 808540 counting only the distinct ones).
The product of its (nonzero) digits is 9144576, while the sum is 57.
The spelling of 20679940164072 in words is "twenty trillion, six hundred seventy-nine billion, nine hundred forty million, one hundred sixty-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •