Base | Representation |
---|---|
bin | 1011110001010101100… |
… | …0000110001010101001 |
3 | 201022222012120010020102 |
4 | 2330111120012022221 |
5 | 11303122324214121 |
6 | 232522145235145 |
7 | 20416152333023 |
oct | 2742530061251 |
9 | 638865503212 |
10 | 202222101161 |
11 | 78842116743 |
12 | 33237932ab5 |
13 | 160b97bb432 |
14 | 9b05273013 |
15 | 53d85a990b |
hex | 2f156062a9 |
202222101161 has 2 divisors, whose sum is σ = 202222101162. Its totient is φ = 202222101160.
The previous prime is 202222101119. The next prime is 202222101181. The reversal of 202222101161 is 161101222202.
It is an a-pointer prime, because the next prime (202222101181) can be obtained adding 202222101161 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 202202209561 + 19891600 = 449669^2 + 4460^2 .
It is a cyclic number.
It is not a de Polignac number, because 202222101161 - 234 = 185042231977 is a prime.
It is not a weakly prime, because it can be changed into another prime (202222101181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101111050580 + 101111050581.
It is an arithmetic number, because the mean of its divisors is an integer number (101111050581).
Almost surely, 2202222101161 is an apocalyptic number.
It is an amenable number.
202222101161 is a deficient number, since it is larger than the sum of its proper divisors (1).
202222101161 is an equidigital number, since it uses as much as digits as its factorization.
202222101161 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 202222101161 its reverse (161101222202), we get a palindrome (363323323363).
The spelling of 202222101161 in words is "two hundred two billion, two hundred twenty-two million, one hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •