Base | Representation |
---|---|
bin | 1001011101111111010100… |
… | …00111100011011001101100 |
3 | 2201201112021111102012021212 |
4 | 10232333222013203121230 |
5 | 10212120201342113033 |
6 | 112141154325213552 |
7 | 4246212336431630 |
oct | 456775207433154 |
9 | 81645244365255 |
10 | 20821634332268 |
11 | 66a8450841880 |
12 | 24034572612b8 |
13 | b80619401943 |
14 | 51dab5978dc0 |
15 | 261942625748 |
hex | 12efea1e366c |
20821634332268 has 192 divisors, whose sum is σ = 48361142860800. Its totient is φ = 7598552924160.
The previous prime is 20821634332241. The next prime is 20821634332283. The reversal of 20821634332268 is 86223343612802.
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, 586358498 + ... + 586394006.
It is an arithmetic number, because the mean of its divisors is an integer number (251880952400).
Almost surely, 220821634332268 is an apocalyptic number.
20821634332268 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20821634332268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24180571430400).
20821634332268 is an abundant number, since it is smaller than the sum of its proper divisors (27539508528532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20821634332268 is a wasteful number, since it uses less digits than its factorization.
20821634332268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36680 (or 36678 counting only the distinct ones).
The product of its (nonzero) digits is 3981312, while the sum is 50.
The spelling of 20821634332268 in words is "twenty trillion, eight hundred twenty-one billion, six hundred thirty-four million, three hundred thirty-two thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •