Base | Representation |
---|---|
bin | 11011101111010110011001… |
… | …011111000100000111000111 |
3 | 120222222012012220011200022022 |
4 | 123233112121133010013013 |
5 | 111442331244000201411 |
6 | 1111250312530553355 |
7 | 34461201340656062 |
oct | 3357263137040707 |
9 | 528865186150268 |
10 | 122001121100231 |
11 | 3596742633120a |
12 | 1182477473885b |
13 | 530c86c01bb59 |
14 | 221ac587918d9 |
15 | e187e0c85edb |
hex | 6ef5997c41c7 |
122001121100231 has 2 divisors, whose sum is σ = 122001121100232. Its totient is φ = 122001121100230.
The previous prime is 122001121100191. The next prime is 122001121100233. The reversal of 122001121100231 is 132001121100221.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122001121100231 is a prime.
It is a super-2 number, since 2×1220011211002312 (a number of 29 digits) contains 22 as substring.
Together with 122001121100233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122001121100233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61000560550115 + 61000560550116.
It is an arithmetic number, because the mean of its divisors is an integer number (61000560550116).
Almost surely, 2122001121100231 is an apocalyptic number.
122001121100231 is a deficient number, since it is larger than the sum of its proper divisors (1).
122001121100231 is an equidigital number, since it uses as much as digits as its factorization.
122001121100231 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 17.
Adding to 122001121100231 its reverse (132001121100221), we get a palindrome (254002242200452).
The spelling of 122001121100231 in words is "one hundred twenty-two trillion, one billion, one hundred twenty-one million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •