Base | Representation |
---|---|
bin | 101111110000001110001110… |
… | …110101001000111011110000 |
3 | 1000112121220111102200220021110 |
4 | 233300032032311020323300 |
5 | 210012000030014231000 |
6 | 2022402435323553320 |
7 | 62144405666524104 |
oct | 5760161665107360 |
9 | 1015556442626243 |
10 | 210022002102000 |
11 | 60a12915a19240 |
12 | 1b67b80768b840 |
13 | 9025cb382406a |
14 | 39c1194cbd904 |
15 | 194324a8c8850 |
hex | bf038ed48ef0 |
210022002102000 has 160 divisors (see below), whose sum is σ = 738666474534144. Its totient is φ = 50914424736000.
The previous prime is 210022002101987. The next prime is 210022002102013. The reversal of 210022002102000 is 201200220012.
It is an interprime number because it is at equal distance from previous prime (210022002101987) and next prime (210022002102013).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1591009774 + ... + 1591141773.
Almost surely, 2210022002102000 is an apocalyptic number.
210022002102000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210022002102000 is an abundant number, since it is smaller than the sum of its proper divisors (528644472432144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210022002102000 is a wasteful number, since it uses less digits than its factorization.
210022002102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3182151584 (or 3182151568 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 210022002102000 its reverse (201200220012), we get a palindrome (210223202322012).
The spelling of 210022002102000 in words is "two hundred ten trillion, twenty-two billion, two million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •