Base | Representation |
---|---|
bin | 1100001110011000111… |
… | …1011000011100111000 |
3 | 202002002201222112000012 |
4 | 3003212033120130320 |
5 | 11420110413102300 |
6 | 240252111401052 |
7 | 21113343635156 |
oct | 3034617303470 |
9 | 662081875005 |
10 | 210021222200 |
11 | 81084560819 |
12 | 34853823188 |
13 | 16a6052a15a |
14 | a244daa3d6 |
15 | 56e3125435 |
hex | 30e63d8738 |
210021222200 has 24 divisors (see below), whose sum is σ = 488299342080. Its totient is φ = 84008488800.
The previous prime is 210021222199. The next prime is 210021222217. The reversal of 210021222200 is 2222120012.
210021222200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 525052856 + ... + 525053255.
It is an arithmetic number, because the mean of its divisors is an integer number (20345805920).
Almost surely, 2210021222200 is an apocalyptic number.
210021222200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210021222200 is an abundant number, since it is smaller than the sum of its proper divisors (278278119880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210021222200 is a wasteful number, since it uses less digits than its factorization.
210021222200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050106127 (or 1050106118 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 210021222200 its reverse (2222120012), we get a palindrome (212243342212).
The spelling of 210021222200 in words is "two hundred ten billion, twenty-one million, two hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •