Base | Representation |
---|---|
bin | 11011110000110010101011… |
… | …101001010000101110001111 |
3 | 121000022122222120102220010021 |
4 | 123300302223221100232033 |
5 | 112000442212230323043 |
6 | 1111404021230123011 |
7 | 34501310012551606 |
oct | 3360625351205617 |
9 | 530278876386107 |
10 | 122100210011023 |
11 | 359a5454450522 |
12 | 1183ba09350467 |
13 | 5319000b5164a |
14 | 222197880aa3d |
15 | e1b1900033ed |
hex | 6f0caba50b8f |
122100210011023 has 2 divisors, whose sum is σ = 122100210011024. Its totient is φ = 122100210011022.
The previous prime is 122100210010993. The next prime is 122100210011027. The reversal of 122100210011023 is 320110012001221.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122100210011023 is a prime.
It is a super-2 number, since 2×1221002100110232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122100210010988 and 122100210011006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122100210011027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61050105005511 + 61050105005512.
It is an arithmetic number, because the mean of its divisors is an integer number (61050105005512).
Almost surely, 2122100210011023 is an apocalyptic number.
122100210011023 is a deficient number, since it is larger than the sum of its proper divisors (1).
122100210011023 is an equidigital number, since it uses as much as digits as its factorization.
122100210011023 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 16.
Adding to 122100210011023 its reverse (320110012001221), we get a palindrome (442210222012244).
The spelling of 122100210011023 in words is "one hundred twenty-two trillion, one hundred billion, two hundred ten million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •