Base | Representation |
---|---|
bin | 11011101111110001011111… |
… | …011001000111010101101011 |
3 | 121000001222022020101112122221 |
4 | 123233301133121013111223 |
5 | 111443320333033430011 |
6 | 1111311523301254511 |
7 | 34463251252012135 |
oct | 3357613731072553 |
9 | 530058266345587 |
10 | 122030211233131 |
11 | 359787a3a13663 |
12 | 1182a332a04437 |
13 | 5312526a44346 |
14 | 221c418032055 |
15 | e19444a84971 |
hex | 6efc5f64756b |
122030211233131 has 2 divisors, whose sum is σ = 122030211233132. Its totient is φ = 122030211233130.
The previous prime is 122030211233123. The next prime is 122030211233141. The reversal of 122030211233131 is 131332112030221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122030211233131 - 23 = 122030211233123 is a prime.
It is a super-2 number, since 2×1220302112331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122030211233096 and 122030211233105.
It is not a weakly prime, because it can be changed into another prime (122030211233141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61015105616565 + 61015105616566.
It is an arithmetic number, because the mean of its divisors is an integer number (61015105616566).
Almost surely, 2122030211233131 is an apocalyptic number.
122030211233131 is a deficient number, since it is larger than the sum of its proper divisors (1).
122030211233131 is an equidigital number, since it uses as much as digits as its factorization.
122030211233131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 122030211233131 its reverse (131332112030221), we get a palindrome (253362323263352).
The spelling of 122030211233131 in words is "one hundred twenty-two trillion, thirty billion, two hundred eleven million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •