Base | Representation |
---|---|
bin | 111000110111001110… |
… | …0011011110100101001 |
3 | 102200012012022221210101 |
4 | 1301232130123310221 |
5 | 4000041140011131 |
6 | 132033020345401 |
7 | 11552023101136 |
oct | 1615634336451 |
9 | 380165287711 |
10 | 122112032041 |
11 | 4787307104a |
12 | 1b7bb0a5261 |
13 | b69092897c |
14 | 5ca5a4558d |
15 | 329a5e7c61 |
hex | 1c6e71bd29 |
122112032041 has 2 divisors, whose sum is σ = 122112032042. Its totient is φ = 122112032040.
The previous prime is 122112032039. The next prime is 122112032047. The reversal of 122112032041 is 140230211221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89997600016 + 32114432025 = 299996^2 + 179205^2 .
It is an emirp because it is prime and its reverse (140230211221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122112032041 - 21 = 122112032039 is a prime.
It is a super-2 number, since 2×1221120320412 (a number of 23 digits) contains 22 as substring.
Together with 122112032039, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (122112032047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61056016020 + 61056016021.
It is an arithmetic number, because the mean of its divisors is an integer number (61056016021).
Almost surely, 2122112032041 is an apocalyptic number.
It is an amenable number.
122112032041 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112032041 is an equidigital number, since it uses as much as digits as its factorization.
122112032041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122112032041 its reverse (140230211221), we get a palindrome (262342243262).
The spelling of 122112032041 in words is "one hundred twenty-two billion, one hundred twelve million, thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •