Base | Representation |
---|---|
bin | 11011110000111101110110… |
… | …011011100001111011011111 |
3 | 121000100210221022201012021221 |
4 | 123300331312123201323133 |
5 | 112001141242220332202 |
6 | 1111413323214434211 |
7 | 34502213130034264 |
oct | 3360756633417337 |
9 | 530323838635257 |
10 | 122112202120927 |
11 | 359aa548703157 |
12 | 118421b5502967 |
13 | 531a192482a75 |
14 | 222239537326b |
15 | e1b642c16037 |
hex | 6f0f766e1edf |
122112202120927 has 2 divisors, whose sum is σ = 122112202120928. Its totient is φ = 122112202120926.
The previous prime is 122112202120919. The next prime is 122112202121029. The reversal of 122112202120927 is 729021202211221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122112202120927 - 23 = 122112202120919 is a prime.
It is a super-2 number, since 2×1221122021209272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122112202120892 and 122112202120901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122112202100927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61056101060463 + 61056101060464.
It is an arithmetic number, because the mean of its divisors is an integer number (61056101060464).
Almost surely, 2122112202120927 is an apocalyptic number.
122112202120927 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112202120927 is an equidigital number, since it uses as much as digits as its factorization.
122112202120927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 34.
The spelling of 122112202120927 in words is "one hundred twenty-two trillion, one hundred twelve billion, two hundred two million, one hundred twenty thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •