Base | Representation |
---|---|
bin | 101101111110011010100011… |
… | …111101001111010111011101 |
3 | 222111221020200202110221201122 |
4 | 231332122203331033113131 |
5 | 203000331100100213041 |
6 | 1554013543021020325 |
7 | 60406361520051062 |
oct | 5576324375172735 |
9 | 874836622427648 |
10 | 202201221101021 |
11 | 59478068a3362a |
12 | 1a817b4b9b46a5 |
13 | 88a9654b141ac |
14 | 37d083c818c69 |
15 | 1859ab77e8c4b |
hex | b7e6a3f4f5dd |
202201221101021 has 2 divisors, whose sum is σ = 202201221101022. Its totient is φ = 202201221101020.
The previous prime is 202201221100987. The next prime is 202201221101051. The reversal of 202201221101021 is 120101122102202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 151001972817796 + 51199248283225 = 12288286^2 + 7155365^2 .
It is a cyclic number.
It is not a de Polignac number, because 202201221101021 - 214 = 202201221084637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202201221101051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100610550510 + 101100610550511.
It is an arithmetic number, because the mean of its divisors is an integer number (101100610550511).
Almost surely, 2202201221101021 is an apocalyptic number.
It is an amenable number.
202201221101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201221101021 is an equidigital number, since it uses as much as digits as its factorization.
202201221101021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202201221101021 its reverse (120101122102202), we get a palindrome (322302343203223).
The spelling of 202201221101021 in words is "two hundred two trillion, two hundred one billion, two hundred twenty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •