Base | Representation |
---|---|
bin | 10010110101000000… |
… | …000100011000000000 |
3 | 1221011221000211010000 |
4 | 102311000010120000 |
5 | 312400420010300 |
6 | 13142023040000 |
7 | 1313661644331 |
oct | 226500043000 |
9 | 57157024100 |
10 | 20216563200 |
11 | 86347a5179 |
12 | 3b025a0000 |
13 | 1ba2510c42 |
14 | d9ad7a288 |
15 | 7d4c97c00 |
hex | 4b5004600 |
20216563200 has 1200 divisors, whose sum is σ = 83990231424. Its totient is φ = 4777574400.
The previous prime is 20216563189. The next prime is 20216563223. The reversal of 20216563200 is 236561202.
20216563200 is a `hidden beast` number, since 2 + 0 + 2 + 1 + 656 + 3 + 2 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (1200).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 546393582 + ... + 546393618.
Almost surely, 220216563200 is an apocalyptic number.
20216563200 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 20216563200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41995115712).
20216563200 is an abundant number, since it is smaller than the sum of its proper divisors (63773668224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20216563200 is a wasteful number, since it uses less digits than its factorization.
20216563200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 95 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 20216563200 in words is "twenty billion, two hundred sixteen million, five hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •