Base | Representation |
---|---|
bin | 101101111101000110100011… |
… | …100111001111100000101101 |
3 | 222111121121212120010010201122 |
4 | 231331012203213033200231 |
5 | 202442341332340134404 |
6 | 1553504304332150325 |
7 | 60400016341035365 |
oct | 5575064347174055 |
9 | 874547776103648 |
10 | 202111021021229 |
11 | 59442891385641 |
12 | 1a8025780083a5 |
13 | 88a0cab70a508 |
14 | 37ca3231179a5 |
15 | 1857588ae93be |
hex | b7d1a39cf82d |
202111021021229 has 2 divisors, whose sum is σ = 202111021021230. Its totient is φ = 202111021021228.
The previous prime is 202111021021159. The next prime is 202111021021249. The reversal of 202111021021229 is 922120120111202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175571245108900 + 26539775912329 = 13250330^2 + 5151677^2 .
It is a cyclic number.
It is not a de Polignac number, because 202111021021229 - 212 = 202111021017133 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 202111021021198 and 202111021021207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202111021021249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101055510510614 + 101055510510615.
It is an arithmetic number, because the mean of its divisors is an integer number (101055510510615).
Almost surely, 2202111021021229 is an apocalyptic number.
It is an amenable number.
202111021021229 is a deficient number, since it is larger than the sum of its proper divisors (1).
202111021021229 is an equidigital number, since it uses as much as digits as its factorization.
202111021021229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 202111021021229 in words is "two hundred two trillion, one hundred eleven billion, twenty-one million, twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •