Base | Representation |
---|---|
bin | 10000010100000001100… |
… | …010010000100010100111 |
3 | 10222011112021021020200121 |
4 | 100110001202100202213 |
5 | 121331313112101434 |
6 | 2214552542222411 |
7 | 143663504445226 |
oct | 20240142204247 |
9 | 3864467236617 |
10 | 1121012222119 |
11 | 3a24671a1519 |
12 | 161314884a07 |
13 | 819320ac1ba |
14 | 3c385d9ccbd |
15 | 1e2605147b4 |
hex | 105018908a7 |
1121012222119 has 2 divisors, whose sum is σ = 1121012222120. Its totient is φ = 1121012222118.
The previous prime is 1121012222093. The next prime is 1121012222129. The reversal of 1121012222119 is 9112222101211.
It is a strong prime.
It is an emirp because it is prime and its reverse (9112222101211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121012222119 - 27 = 1121012221991 is a prime.
It is a super-2 number, since 2×11210122221192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121012222093 and 1121012222102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121012222129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560506111059 + 560506111060.
It is an arithmetic number, because the mean of its divisors is an integer number (560506111060).
Almost surely, 21121012222119 is an apocalyptic number.
1121012222119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121012222119 is an equidigital number, since it uses as much as digits as its factorization.
1121012222119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 1121012222119 in words is "one trillion, one hundred twenty-one billion, twelve million, two hundred twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •