Base | Representation |
---|---|
bin | 10011110000001110… |
… | …111000011000110000 |
3 | 2000202011220222110202 |
4 | 103300032320120300 |
5 | 321414314131000 |
6 | 13424402214332 |
7 | 1350416410106 |
oct | 236016703060 |
9 | 60664828422 |
10 | 21210302000 |
11 | 8aa4731908 |
12 | 413b3543a8 |
13 | 2000368274 |
14 | 1052d37c76 |
15 | 84213ddd5 |
hex | 4f03b8630 |
21210302000 has 80 divisors (see below), whose sum is σ = 51863198400. Its totient is φ = 8388723200.
The previous prime is 21210301969. The next prime is 21210302023. The reversal of 21210302000 is 20301212.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118421 + ... + 237579.
It is an arithmetic number, because the mean of its divisors is an integer number (648289980).
Almost surely, 221210302000 is an apocalyptic number.
21210302000 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 21210302000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25931599200).
21210302000 is an abundant number, since it is smaller than the sum of its proper divisors (30652896400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210302000 is a wasteful number, since it uses less digits than its factorization.
21210302000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119271 (or 119255 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 21210302000 its reverse (20301212), we get a palindrome (21230603212).
The spelling of 21210302000 in words is "twenty-one billion, two hundred ten million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •