Base | Representation |
---|---|
bin | 10000010100000110110… |
… | …101110000100100011011 |
3 | 10222011202110201210222222 |
4 | 100110012311300210123 |
5 | 121332003403020443 |
6 | 2215005441534255 |
7 | 143665635065513 |
oct | 20240665604433 |
9 | 3864673653888 |
10 | 1121101220123 |
11 | 3a2502458a95 |
12 | 16133a64438b |
13 | 81947670041 |
14 | 3c393b28843 |
15 | 1e268244468 |
hex | 10506d7091b |
1121101220123 has 2 divisors, whose sum is σ = 1121101220124. Its totient is φ = 1121101220122.
The previous prime is 1121101220093. The next prime is 1121101220143. The reversal of 1121101220123 is 3210221011211.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (3210221011211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121101220123 - 238 = 846223313179 is a prime.
It is a super-2 number, since 2×11211012201232 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1121101220143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560550610061 + 560550610062.
It is an arithmetic number, because the mean of its divisors is an integer number (560550610062).
Almost surely, 21121101220123 is an apocalyptic number.
1121101220123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121101220123 is an equidigital number, since it uses as much as digits as its factorization.
1121101220123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1121101220123 its reverse (3210221011211), we get a palindrome (4331322231334).
The spelling of 1121101220123 in words is "one trillion, one hundred twenty-one billion, one hundred one million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •