Base | Representation |
---|---|
bin | 10011000001010010… |
… | …110011001010000000 |
3 | 1221201022002201211000 |
4 | 103001102303022000 |
5 | 313311214100000 |
6 | 13214311252000 |
7 | 1322044635651 |
oct | 230122631200 |
9 | 57638081730 |
10 | 20422800000 |
11 | 8730157a09 |
12 | 3b5b67a000 |
13 | 1c0616cc55 |
14 | dba503528 |
15 | 7e7e35000 |
hex | 4c14b3280 |
20422800000 has 768 divisors, whose sum is σ = 79044940800. Its totient is φ = 5184000000.
The previous prime is 20422799983. The next prime is 20422800001. The reversal of 20422800000 is 822402.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20422800001) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 334799970 + ... + 334800030.
It is an arithmetic number, because the mean of its divisors is an integer number (102923100).
Almost surely, 220422800000 is an apocalyptic number.
20422800000 is a gapful number since it is divisible by the number (20) 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 20422800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39522470400).
20422800000 is an abundant number, since it is smaller than the sum of its proper divisors (58622140800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20422800000 is an frugal number, since it uses more digits than its factorization.
20422800000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
The spelling of 20422800000 in words is "twenty billion, four hundred twenty-two million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •