Base | Representation |
---|---|
bin | 111000110110110111… |
… | …0111101001100101001 |
3 | 102200011100220020222210 |
4 | 1301231232331030221 |
5 | 4000030112010441 |
6 | 132031513035333 |
7 | 11551516545303 |
oct | 1615556751451 |
9 | 380140806883 |
10 | 122100110121 |
11 | 47867368a20 |
12 | 1b7b70b5b49 |
13 | b68b313392 |
14 | 5ca4220973 |
15 | 3299540616 |
hex | 1c6dbbd329 |
122100110121 has 16 divisors (see below), whose sum is σ = 177741285120. Its totient is φ = 73941264720.
The previous prime is 122100110113. The next prime is 122100110137. The reversal of 122100110121 is 121011001221.
It is not a de Polignac number, because 122100110121 - 23 = 122100110113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122100110097 and 122100110106.
It is not an unprimeable number, because it can be changed into a prime (122100111121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1427875 + ... + 1510968.
It is an arithmetic number, because the mean of its divisors is an integer number (11108830320).
Almost surely, 2122100110121 is an apocalyptic number.
122100110121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122100110121 is a deficient number, since it is larger than the sum of its proper divisors (55641174999).
122100110121 is a wasteful number, since it uses less digits than its factorization.
122100110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2940116.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122100110121 its reverse (121011001221), we get a palindrome (243111111342).
It can be divided in two parts, 122100 and 110121, that added together give a triangular number (232221 = T681).
The spelling of 122100110121 in words is "one hundred twenty-two billion, one hundred million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •