Base | Representation |
---|---|
bin | 11011110000111101101100… |
… | …001011101101100101110111 |
3 | 121000100210111100012211011211 |
4 | 123300331230023231211313 |
5 | 112001140414212432411 |
6 | 1111413254153542251 |
7 | 34502205641534506 |
oct | 3360755413554567 |
9 | 530323440184154 |
10 | 122112030202231 |
11 | 359aa46a660093 |
12 | 11842167a14987 |
13 | 531a16597b324 |
14 | 222237a5c083d |
15 | e1b632aa7221 |
hex | 6f0f6c2ed977 |
122112030202231 has 2 divisors, whose sum is σ = 122112030202232. Its totient is φ = 122112030202230.
The previous prime is 122112030202187. The next prime is 122112030202259. The reversal of 122112030202231 is 132202030211221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122112030202231 - 225 = 122111996647799 is a prime.
It is a super-2 number, since 2×1221120302022312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122112030302231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61056015101115 + 61056015101116.
It is an arithmetic number, because the mean of its divisors is an integer number (61056015101116).
Almost surely, 2122112030202231 is an apocalyptic number.
122112030202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112030202231 is an equidigital number, since it uses as much as digits as its factorization.
122112030202231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 122112030202231 its reverse (132202030211221), we get a palindrome (254314060413452).
The spelling of 122112030202231 in words is "one hundred twenty-two trillion, one hundred twelve billion, thirty million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •