Base | Representation |
---|---|
bin | 10000010100001100101… |
… | …111000010100010100111 |
3 | 10222012000100211112220022 |
4 | 100110030233002202213 |
5 | 121332204212401043 |
6 | 2215023333425355 |
7 | 144001245535322 |
oct | 20241457024247 |
9 | 3865010745808 |
10 | 1121200122023 |
11 | 3a255326a4a3 |
12 | 16136779b25b |
13 | 81961cbaa87 |
14 | 3c3a2d117b9 |
15 | 1e271c7d868 |
hex | 1050cbc28a7 |
1121200122023 has 2 divisors, whose sum is σ = 1121200122024. Its totient is φ = 1121200122022.
The previous prime is 1121200121971. The next prime is 1121200122047. The reversal of 1121200122023 is 3202210021211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1121200122023 - 230 = 1120126380199 is a prime.
It is a super-2 number, since 2×11212001220232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121200121992 and 1121200122010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121200122073) 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, 560600061011 + 560600061012.
It is an arithmetic number, because the mean of its divisors is an integer number (560600061012).
Almost surely, 21121200122023 is an apocalyptic number.
1121200122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121200122023 is an equidigital number, since it uses as much as digits as its factorization.
1121200122023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1121200122023 its reverse (3202210021211), we get a palindrome (4323410143234).
The spelling of 1121200122023 in words is "one trillion, one hundred twenty-one billion, two hundred million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •