Base | Representation |
---|---|
bin | 11011101111110011010110… |
… | …100110000111011111000011 |
3 | 121000002011110121112211211201 |
4 | 123233303112212013133003 |
5 | 111443333432022132212 |
6 | 1111312453542122031 |
7 | 34463351644605142 |
oct | 3357632646073703 |
9 | 530064417484751 |
10 | 122032211130307 |
11 | 3597962a89aa45 |
12 | 1182a7b0720317 |
13 | 531278518395a |
14 | 221c5678a1759 |
15 | e19510426b57 |
hex | 6efcd69877c3 |
122032211130307 has 2 divisors, whose sum is σ = 122032211130308. Its totient is φ = 122032211130306.
The previous prime is 122032211130281. The next prime is 122032211130317. The reversal of 122032211130307 is 703031112230221.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122032211130307 is a prime.
It is a super-3 number, since 3×1220322111303073 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (122032211130317) 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, 61016105565153 + 61016105565154.
It is an arithmetic number, because the mean of its divisors is an integer number (61016105565154).
Almost surely, 2122032211130307 is an apocalyptic number.
122032211130307 is a deficient number, since it is larger than the sum of its proper divisors (1).
122032211130307 is an equidigital number, since it uses as much as digits as its factorization.
122032211130307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 122032211130307 its reverse (703031112230221), we get a palindrome (825063323360528).
The spelling of 122032211130307 in words is "one hundred twenty-two trillion, thirty-two billion, two hundred eleven million, one hundred thirty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •