Base | Representation |
---|---|
bin | 111000110100001011… |
… | …1100110100110111000 |
3 | 102122221002112101100002 |
4 | 1301220113212212320 |
5 | 3444334041232300 |
6 | 132014535532132 |
7 | 11546344520450 |
oct | 1615027464670 |
9 | 378832471302 |
10 | 122010102200 |
11 | 47820581708 |
12 | 1b790b2a048 |
13 | b67578a95c |
14 | 5c962b0d60 |
15 | 32916b15d5 |
hex | 1c685e69b8 |
122010102200 has 96 divisors (see below), whose sum is σ = 330315420960. Its totient is φ = 41042726400.
The previous prime is 122010102143. The next prime is 122010102223. The reversal of 122010102200 is 2201010221.
It is a happy number.
122010102200 is digitally balanced in base 3, 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 23 ways as a sum of consecutive naturals, for example, 747971 + ... + 896370.
It is an arithmetic number, because the mean of its divisors is an integer number (3440785635).
Almost surely, 2122010102200 is an apocalyptic number.
122010102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122010102200 is an abundant number, since it is smaller than the sum of its proper divisors (208305318760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122010102200 is a wasteful number, since it uses less digits than its factorization.
122010102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1644417 (or 1644408 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 122010102200 its reverse (2201010221), we get a palindrome (124211112421).
The spelling of 122010102200 in words is "one hundred twenty-two billion, ten million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •