Base | Representation |
---|---|
bin | 110010011111111111101100… |
… | …100001101101001001110011 |
3 | 1002010101122120002211220222102 |
4 | 302133333230201231021303 |
5 | 213102400343124232011 |
6 | 2104211445002531015 |
7 | 64532161242466544 |
oct | 6237775441551163 |
9 | 1063348502756872 |
10 | 222101022102131 |
11 | 6484a5728a6777 |
12 | 20ab07bab06a6b |
13 | 96c10622c1a73 |
14 | 3cbba654144cb |
15 | 1aa2555c3773b |
hex | c9ffec86d273 |
222101022102131 has 2 divisors, whose sum is σ = 222101022102132. Its totient is φ = 222101022102130.
The previous prime is 222101022102053. The next prime is 222101022102149. The reversal of 222101022102131 is 131201220101222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222101022102131 - 242 = 217702975591027 is a prime.
It is a super-2 number, since 2×2221010221021312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (222101022102151) 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, 111050511051065 + 111050511051066.
It is an arithmetic number, because the mean of its divisors is an integer number (111050511051066).
Almost surely, 2222101022102131 is an apocalyptic number.
222101022102131 is a deficient number, since it is larger than the sum of its proper divisors (1).
222101022102131 is an equidigital number, since it uses as much as digits as its factorization.
222101022102131 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 20.
Adding to 222101022102131 its reverse (131201220101222), we get a palindrome (353302242203353).
The spelling of 222101022102131 in words is "two hundred twenty-two trillion, one hundred one billion, twenty-two million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •