Base | Representation |
---|---|
bin | 11011110000110010100101… |
… | …001101101100011010001100 |
3 | 121000022122201001102111222012 |
4 | 123300302211031230122030 |
5 | 112000442002120333400 |
6 | 1111404002413440352 |
7 | 34501304232525665 |
oct | 3360624515543214 |
9 | 530278631374865 |
10 | 122100102121100 |
11 | 359a53a95601a4 |
12 | 1183b9991a00b8 |
13 | 5318cb46a785c |
14 | 222196836436c |
15 | e1b1857e0d35 |
hex | 6f0ca536c68c |
122100102121100 has 36 divisors (see below), whose sum is σ = 280542940524504. Its totient is φ = 45967097268480.
The previous prime is 122100102121013. The next prime is 122100102121141. The reversal of 122100102121100 is 1121201001221.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35911793042 + ... + 35911796441.
It is an arithmetic number, because the mean of its divisors is an integer number (7792859459014).
Almost surely, 2122100102121100 is an apocalyptic number.
122100102121100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122100102121100 is an abundant number, since it is smaller than the sum of its proper divisors (158442838403404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122100102121100 is a wasteful number, since it uses less digits than its factorization.
122100102121100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71823589514 (or 71823589507 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122100102121100 its reverse (1121201001221), we get a palindrome (123221303122321).
The spelling of 122100102121100 in words is "one hundred twenty-two trillion, one hundred billion, one hundred two million, one hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •