Base | Representation |
---|---|
bin | 1101011000000… |
… | …11000011001001 |
3 | 21211010212100102 |
4 | 12230003003021 |
5 | 212211210441 |
6 | 15045015145 |
7 | 2531525132 |
oct | 654030311 |
9 | 254125312 |
10 | 112210121 |
11 | 58381141 |
12 | 316b44b5 |
13 | 1a32a32a |
14 | 10c8cc89 |
15 | 9cb769b |
hex | 6b030c9 |
112210121 has 2 divisors, whose sum is σ = 112210122. Its totient is φ = 112210120.
The previous prime is 112210097. The next prime is 112210129. The reversal of 112210121 is 121012211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60528400 + 51681721 = 7780^2 + 7189^2 .
It is an emirp because it is prime and its reverse (121012211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112210121 - 26 = 112210057 is a prime.
It is a super-2 number, since 2×1122101212 = 25182222509669282, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (112210129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56105060 + 56105061.
It is an arithmetic number, because the mean of its divisors is an integer number (56105061).
Almost surely, 2112210121 is an apocalyptic number.
It is an amenable number.
112210121 is a deficient number, since it is larger than the sum of its proper divisors (1).
112210121 is an equidigital number, since it uses as much as digits as its factorization.
112210121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 112210121 is about 10592.9278766543. The cubic root of 112210121 is about 482.3297058925.
Adding to 112210121 its reverse (121012211), we get a palindrome (233222332).
The spelling of 112210121 in words is "one hundred twelve million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •