Base | Representation |
---|---|
bin | 11011110010011001000010… |
… | …110011011100001000010111 |
3 | 121000201011200101220002000121 |
4 | 123302121002303130020113 |
5 | 112004242311234034312 |
6 | 1111530315411252411 |
7 | 34512250464123304 |
oct | 3362310263341027 |
9 | 530634611802017 |
10 | 122210120221207 |
11 | 35a38025943177 |
12 | 11859181baa107 |
13 | 5326498871185 |
14 | 2227003ada0ab |
15 | e1de742b1707 |
hex | 6f2642cdc217 |
122210120221207 has 2 divisors, whose sum is σ = 122210120221208. Its totient is φ = 122210120221206.
The previous prime is 122210120221201. The next prime is 122210120221243. The reversal of 122210120221207 is 702122021012221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122210120221207 - 231 = 122207972737559 is a prime.
It is a super-2 number, since 2×1222101202212072 (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 (122210120221201) 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, 61105060110603 + 61105060110604.
It is an arithmetic number, because the mean of its divisors is an integer number (61105060110604).
Almost surely, 2122210120221207 is an apocalyptic number.
122210120221207 is a deficient number, since it is larger than the sum of its proper divisors (1).
122210120221207 is an equidigital number, since it uses as much as digits as its factorization.
122210120221207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 25.
Adding to 122210120221207 its reverse (702122021012221), we get a palindrome (824332141233428).
The spelling of 122210120221207 in words is "one hundred twenty-two trillion, two hundred ten billion, one hundred twenty million, two hundred twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •