Base | Representation |
---|---|
bin | 11011110000110101011110… |
… | …000011000001110011101111 |
3 | 121000022221201011111002012122 |
4 | 123300311132003001303233 |
5 | 112001014324444011002 |
6 | 1111405234230423155 |
7 | 34501444125513221 |
oct | 3360653603016357 |
9 | 530287634432178 |
10 | 122103203110127 |
11 | 359a674aa28148 |
12 | 11840503801abb |
13 | 5319389c8aac5 |
14 | 2221b80138411 |
15 | e1b2b7b826a2 |
hex | 6f0d5e0c1cef |
122103203110127 has 2 divisors, whose sum is σ = 122103203110128. Its totient is φ = 122103203110126.
The previous prime is 122103203110103. The next prime is 122103203110171. The reversal of 122103203110127 is 721011302301221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122103203110127 - 28 = 122103203109871 is a prime.
It is a super-2 number, since 2×1221032031101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122103203110096 and 122103203110105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122103203119127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61051601555063 + 61051601555064.
It is an arithmetic number, because the mean of its divisors is an integer number (61051601555064).
Almost surely, 2122103203110127 is an apocalyptic number.
122103203110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
122103203110127 is an equidigital number, since it uses as much as digits as its factorization.
122103203110127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 122103203110127 its reverse (721011302301221), we get a palindrome (843114505411348).
The spelling of 122103203110127 in words is "one hundred twenty-two trillion, one hundred three billion, two hundred three million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •