Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …01000101000000111101 |
3 | 10120112222122121020200202 |
4 | 32230220231011000331 |
5 | 113021440024021341 |
6 | 2051553201533245 |
7 | 132653514136016 |
oct | 16545055050075 |
9 | 3515878536622 |
10 | 1010000220221 |
11 | 35a37a880403 |
12 | 1438b3044225 |
13 | 74320032305 |
14 | 36c5462600d |
15 | 1b41466979b |
hex | eb28b4503d |
1010000220221 has 2 divisors, whose sum is σ = 1010000220222. Its totient is φ = 1010000220220.
The previous prime is 1010000220193. The next prime is 1010000220223. The reversal of 1010000220221 is 1220220000101.
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., 1009803912100 + 196308121 = 1004890^2 + 14011^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010000220221 - 226 = 1009933111357 is a prime.
Together with 1010000220223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010000220223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505000110110 + 505000110111.
It is an arithmetic number, because the mean of its divisors is an integer number (505000110111).
Almost surely, 21010000220221 is an apocalyptic number.
It is an amenable number.
1010000220221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010000220221 is an equidigital number, since it uses as much as digits as its factorization.
1010000220221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1010000220221 its reverse (1220220000101), we get a palindrome (2230220220322).
The spelling of 1010000220221 in words is "one trillion, ten billion, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •