Base | Representation |
---|---|
bin | 111000110011111000… |
… | …1011100101100001111 |
3 | 102122220101201020001100 |
4 | 1301213301130230033 |
5 | 3444324011200421 |
6 | 132013541314143 |
7 | 11546163512031 |
oct | 1614761345417 |
9 | 378811636040 |
10 | 122000100111 |
11 | 4781596aa1a |
12 | 1b789705953 |
13 | b673698166 |
14 | 5c94c29c51 |
15 | 3290887c26 |
hex | 1c67c5cb0f |
122000100111 has 24 divisors (see below), whose sum is σ = 181290629520. Its totient is φ = 79001623296.
The previous prime is 122000100097. The next prime is 122000100121. The reversal of 122000100111 is 111001000221.
It is a happy number.
It is not a de Polignac number, because 122000100111 - 27 = 122000099983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 122000100093 and 122000100102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122000100121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 111441 + ... + 506378.
It is an arithmetic number, because the mean of its divisors is an integer number (7553776230).
Almost surely, 2122000100111 is an apocalyptic number.
122000100111 is a deficient number, since it is larger than the sum of its proper divisors (59290529409).
122000100111 is a wasteful number, since it uses less digits than its factorization.
122000100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618455 (or 618452 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 122000100111 its reverse (111001000221), we get a palindrome (233001100332).
It can be divided in two parts, 122000 and 100111, that added together give a triangular number (222111 = T666).
The spelling of 122000100111 in words is "one hundred twenty-two billion, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •