Base | Representation |
---|---|
bin | 11011110000110011011011… |
… | …011101011000001001110100 |
3 | 121000022202001110220102101220 |
4 | 123300303123131120021310 |
5 | 112001000333110431400 |
6 | 1111404233003550340 |
7 | 34501335623222241 |
oct | 3360633335301164 |
9 | 530282043812356 |
10 | 122101012202100 |
11 | 359a5826248558 |
12 | 1183bbb1b2b3b0 |
13 | 53190cb0c0919 |
14 | 2221a131865c8 |
15 | e1b1da65e7a0 |
hex | 6f0cdb758274 |
122101012202100 has 144 divisors (see below), whose sum is σ = 366782976053760. Its totient is φ = 31327799846400.
The previous prime is 122101012202083. The next prime is 122101012202119. The reversal of 122101012202100 is 1202210101221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 122101012202100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 36336595 + ... + 39554394.
Almost surely, 2122101012202100 is an apocalyptic number.
122101012202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122101012202100 is an abundant number, since it is smaller than the sum of its proper divisors (244681963851660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122101012202100 is a wasteful number, since it uses less digits than its factorization.
122101012202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75891210 (or 75891203 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122101012202100 its reverse (1202210101221), we get a palindrome (123303222303321).
The spelling of 122101012202100 in words is "one hundred twenty-two trillion, one hundred one billion, twelve million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •