Base | Representation |
---|---|
bin | 111000110111001110… |
… | …1001100001011101001 |
3 | 102200012012201000111200 |
4 | 1301232131030023221 |
5 | 4000041212330441 |
6 | 132033024514413 |
7 | 11552024554500 |
oct | 1615635141351 |
9 | 380165630450 |
10 | 122112230121 |
11 | 47873196952 |
12 | 1b7bb17ba09 |
13 | b690997b8b |
14 | 5ca5a97837 |
15 | 329a6367b6 |
hex | 1c6e74c2e9 |
122112230121 has 36 divisors (see below), whose sum is σ = 206797473792. Its totient is φ = 69228949104.
The previous prime is 122112230117. The next prime is 122112230143. The reversal of 122112230121 is 121032211221.
122112230121 is a `hidden beast` number, since 1 + 221 + 122 + 301 + 21 = 666.
It is not a de Polignac number, because 122112230121 - 22 = 122112230117 is a prime.
It is a super-2 number, since 2×1221122301212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122112230094 and 122112230103.
It is not an unprimeable number, because it can be changed into a prime (122112230621) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1034145 + ... + 1146158.
It is an arithmetic number, because the mean of its divisors is an integer number (5744374272).
Almost surely, 2122112230121 is an apocalyptic number.
It is an amenable number.
122112230121 is a deficient number, since it is larger than the sum of its proper divisors (84685243671).
122112230121 is a wasteful number, since it uses less digits than its factorization.
122112230121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2180450 (or 2180440 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 122112230121 its reverse (121032211221), we get a palindrome (243144441342).
The spelling of 122112230121 in words is "one hundred twenty-two billion, one hundred twelve million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •