Base | Representation |
---|---|
bin | 1100001110011001001… |
… | …0011000110010010000 |
3 | 202002002210110112122222 |
4 | 3003212102120302100 |
5 | 11420111113310000 |
6 | 240252140320212 |
7 | 21113353426025 |
oct | 3034622306220 |
9 | 662083415588 |
10 | 210022010000 |
11 | 81084a496a0 |
12 | 34853b43068 |
13 | 16a607448ca |
14 | a24513354c |
15 | 56e322da85 |
hex | 30e6498c90 |
210022010000 has 300 divisors, whose sum is σ = 585753186480. Its totient is φ = 72123840000.
The previous prime is 210022009937. The next prime is 210022010039. The reversal of 210022010000 is 10220012.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 210022010000.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 662529842 + ... + 662530158.
Almost surely, 2210022010000 is an apocalyptic number.
210022010000 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 210022010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (292876593240).
210022010000 is an abundant number, since it is smaller than the sum of its proper divisors (375731176480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210022010000 is an equidigital number, since it uses as much as digits as its factorization.
210022010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692 (or 354 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 210022010000 its reverse (10220012), we get a palindrome (210032230012).
The spelling of 210022010000 in words is "two hundred ten billion, twenty-two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •