Base | Representation |
---|---|
bin | 11011110001000101000111… |
… | …010110100000100011010111 |
3 | 121000101120001220221202222002 |
4 | 123301011013112200203113 |
5 | 112001303231031210012 |
6 | 1111421053213425515 |
7 | 34502610332510624 |
oct | 3361050726404327 |
9 | 530346056852862 |
10 | 122120002210007 |
11 | 35a0289064956a |
12 | 1184381179b29b |
13 | 531ab364702a9 |
14 | 22228d527d34b |
15 | e1b94c8c37c2 |
hex | 6f11475a08d7 |
122120002210007 has 2 divisors, whose sum is σ = 122120002210008. Its totient is φ = 122120002210006.
The previous prime is 122120002209943. The next prime is 122120002210033. The reversal of 122120002210007 is 700012200021221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122120002210007 - 26 = 122120002209943 is a prime.
It is a super-2 number, since 2×1221200022100072 (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 (122120002210307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61060001105003 + 61060001105004.
It is an arithmetic number, because the mean of its divisors is an integer number (61060001105004).
Almost surely, 2122120002210007 is an apocalyptic number.
122120002210007 is a deficient number, since it is larger than the sum of its proper divisors (1).
122120002210007 is an equidigital number, since it uses as much as digits as its factorization.
122120002210007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 122120002210007 its reverse (700012200021221), we get a palindrome (822132202231228).
The spelling of 122120002210007 in words is "one hundred twenty-two trillion, one hundred twenty billion, two million, two hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •