Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …0110011001010011101 |
3 | 201020100010002200100111 |
4 | 2323120210303022131 |
5 | 11244030204133041 |
6 | 232233025330021 |
7 | 20351654650321 |
oct | 2733044631235 |
9 | 636303080314 |
10 | 201202021021 |
11 | 78369328401 |
12 | 32bb2196911 |
13 | 15c86370511 |
14 | 9a499b9981 |
15 | 5378c5d981 |
hex | 2ed893329d |
201202021021 has 2 divisors, whose sum is σ = 201202021022. Its totient is φ = 201202021020.
The previous prime is 201202020977. The next prime is 201202021063. The reversal of 201202021021 is 120120202102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116680995396 + 84521025625 = 341586^2 + 290725^2 .
It is a cyclic number.
It is not a de Polignac number, because 201202021021 - 223 = 201193632413 is a prime.
It is a super-3 number, since 3×2012020210213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201202020992 and 201202021010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201202021081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100601010510 + 100601010511.
It is an arithmetic number, because the mean of its divisors is an integer number (100601010511).
Almost surely, 2201202021021 is an apocalyptic number.
It is an amenable number.
201202021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
201202021021 is an equidigital number, since it uses as much as digits as its factorization.
201202021021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201202021021 its reverse (120120202102), we get a palindrome (321322223123).
The spelling of 201202021021 in words is "two hundred one billion, two hundred two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •