Base | Representation |
---|---|
bin | 11101011001010001101… |
… | …00001111111111111101 |
3 | 10120112222210010202120101 |
4 | 32230220310033333331 |
5 | 113021441014201341 |
6 | 2051553310121101 |
7 | 132653536126042 |
oct | 16545064177775 |
9 | 3515883122511 |
10 | 1010002100221 |
11 | 35a380944924 |
12 | 1438b37b0191 |
13 | 7432053cc3a |
14 | 36c549951c9 |
15 | 1b4148db831 |
hex | eb28d0fffd |
1010002100221 has 2 divisors, whose sum is σ = 1010002100222. Its totient is φ = 1010002100220.
The previous prime is 1010002100207. The next prime is 1010002100243. The reversal of 1010002100221 is 1220012000101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 516831588100 + 493170512121 = 718910^2 + 702261^2 .
It is an emirp because it is prime and its reverse (1220012000101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010002100221 - 29 = 1010002099709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010002100198 and 1010002100207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010002100251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505001050110 + 505001050111.
It is an arithmetic number, because the mean of its divisors is an integer number (505001050111).
Almost surely, 21010002100221 is an apocalyptic number.
It is an amenable number.
1010002100221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010002100221 is an equidigital number, since it uses as much as digits as its factorization.
1010002100221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1010002100221 its reverse (1220012000101), we get a palindrome (2230014100322).
The spelling of 1010002100221 in words is "one trillion, ten billion, two million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •