Base | Representation |
---|---|
bin | 101101111110011010011110… |
… | …000100000000000101001001 |
3 | 222111221020102212101202220201 |
4 | 231332122132010000011021 |
5 | 203000330344241210441 |
6 | 1554013525125252201 |
7 | 60406356206355316 |
oct | 5576323604000511 |
9 | 874836385352821 |
10 | 202201122210121 |
11 | 5947801812a411 |
12 | 1a817b22864061 |
13 | 88a963a49b478 |
14 | 37d082d635d0d |
15 | 1859aadcb2c31 |
hex | b7e69e100149 |
202201122210121 has 2 divisors, whose sum is σ = 202201122210122. Its totient is φ = 202201122210120.
The previous prime is 202201122210119. The next prime is 202201122210137. The reversal of 202201122210121 is 121012221102202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 173110859265600 + 29090262944521 = 13157160^2 + 5393539^2 .
It is a cyclic number.
It is not a de Polignac number, because 202201122210121 - 21 = 202201122210119 is a prime.
Together with 202201122210119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (202201122240121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100561105060 + 101100561105061.
It is an arithmetic number, because the mean of its divisors is an integer number (101100561105061).
Almost surely, 2202201122210121 is an apocalyptic number.
It is an amenable number.
202201122210121 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201122210121 is an equidigital number, since it uses as much as digits as its factorization.
202201122210121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 202201122210121 its reverse (121012221102202), we get a palindrome (323213343312323).
The spelling of 202201122210121 in words is "two hundred two trillion, two hundred one billion, one hundred twenty-two million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •