Base | Representation |
---|---|
bin | 111000110110110111… |
… | …0100111001110001111 |
3 | 102200011100201200112002 |
4 | 1301231232213032033 |
5 | 4000030101120421 |
6 | 132031511102515 |
7 | 11551516022006 |
oct | 1615556471617 |
9 | 380140650462 |
10 | 122100020111 |
11 | 47867307333 |
12 | 1b7b7071a3b |
13 | b68b2b1414 |
14 | 5ca41d9c3d |
15 | 3299523b0b |
hex | 1c6dba738f |
122100020111 has 16 divisors (see below), whose sum is σ = 125798400000. Its totient is φ = 118436606400.
The previous prime is 122100020101. The next prime is 122100020113. The reversal of 122100020111 is 111020001221.
It is a cyclic number.
It is not a de Polignac number, because 122100020111 - 230 = 121026278287 is a prime.
It is a super-2 number, since 2×1221000201112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122100020092 and 122100020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122100020113) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 24422390 + ... + 24427388.
It is an arithmetic number, because the mean of its divisors is an integer number (7862400000).
Almost surely, 2122100020111 is an apocalyptic number.
122100020111 is a deficient number, since it is larger than the sum of its proper divisors (3698379889).
122100020111 is a wasteful number, since it uses less digits than its factorization.
122100020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8350.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 122100020111 its reverse (111020001221), we get a palindrome (233120021332).
The spelling of 122100020111 in words is "one hundred twenty-two billion, one hundred million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •