Base | Representation |
---|---|
bin | 11101101110001000100… |
… | …01100111100111011001 |
3 | 10121121220012100021122011 |
4 | 32313010101213213121 |
5 | 113212404222432301 |
6 | 2101044412225521 |
7 | 133531202332504 |
oct | 16670421474731 |
9 | 3547805307564 |
10 | 1021200202201 |
11 | 3640a7989663 |
12 | 145ab9a6b2a1 |
13 | 753b650899a |
14 | 375d7cb213b |
15 | 1b86ca5ca51 |
hex | edc44679d9 |
1021200202201 has 2 divisors, whose sum is σ = 1021200202202. Its totient is φ = 1021200202200.
The previous prime is 1021200202199. The next prime is 1021200202213. The reversal of 1021200202201 is 1022020021201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999302121801 + 21898080400 = 999651^2 + 147980^2 .
It is an emirp because it is prime and its reverse (1022020021201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1021200202201 - 21 = 1021200202199 is a prime.
Together with 1021200202199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1021200202241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510600101100 + 510600101101.
It is an arithmetic number, because the mean of its divisors is an integer number (510600101101).
Almost surely, 21021200202201 is an apocalyptic number.
It is an amenable number.
1021200202201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021200202201 is an equidigital number, since it uses as much as digits as its factorization.
1021200202201 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 1021200202201 its reverse (1022020021201), we get a palindrome (2043220223402).
The spelling of 1021200202201 in words is "one trillion, twenty-one billion, two hundred million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •