Base | Representation |
---|---|
bin | 11011010010001111110110… |
… | …001110001101001011111111 |
3 | 120201220000010111120100001022 |
4 | 123102033312032031023333 |
5 | 111212100000340431421 |
6 | 1103115444520534355 |
7 | 34163542103552465 |
oct | 3322176616151377 |
9 | 521800114510038 |
10 | 120001222202111 |
11 | 352662615647a8 |
12 | 1156105a6213bb |
13 | 51c60b36c59a3 |
14 | 218c1394dc835 |
15 | dd1791ac97ab |
hex | 6d23f638d2ff |
120001222202111 has 2 divisors, whose sum is σ = 120001222202112. Its totient is φ = 120001222202110.
The previous prime is 120001222202083. The next prime is 120001222202119. The reversal of 120001222202111 is 111202222100021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120001222202111 - 234 = 119984042332927 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120001222202111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120001222202119) 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, 60000611101055 + 60000611101056.
It is an arithmetic number, because the mean of its divisors is an integer number (60000611101056).
Almost surely, 2120001222202111 is an apocalyptic number.
120001222202111 is a deficient number, since it is larger than the sum of its proper divisors (1).
120001222202111 is an equidigital number, since it uses as much as digits as its factorization.
120001222202111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120001222202111 its reverse (111202222100021), we get a palindrome (231203444302132).
The spelling of 120001222202111 in words is "one hundred twenty trillion, one billion, two hundred twenty-two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •