Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111100000010010101101 |
3 | 21010011012010022212021102 |
4 | 131033331333200102231 |
5 | 230413000304311341 |
6 | 4135215235412445 |
7 | 265134642454544 |
oct | 35177577402255 |
9 | 7104163285242 |
10 | 2010011010221 |
11 | 7054938a5a55 |
12 | 285678754125 |
13 | 11770a608166 |
14 | 6d3dc27b15b |
15 | 37441d12c9b |
hex | 1d3fdfe04ad |
2010011010221 has 2 divisors, whose sum is σ = 2010011010222. Its totient is φ = 2010011010220.
The previous prime is 2010011010199. The next prime is 2010011010223. The reversal of 2010011010221 is 1220101100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2008282945321 + 1728064900 = 1417139^2 + 41570^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010011010221 - 230 = 2008937268397 is a prime.
It is a super-2 number, since 2×20100110102212 (a number of 25 digits) contains 22 as substring.
Together with 2010011010223, 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 (2010011010223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005005505110 + 1005005505111.
It is an arithmetic number, because the mean of its divisors is an integer number (1005005505111).
Almost surely, 22010011010221 is an apocalyptic number.
It is an amenable number.
2010011010221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010011010221 is an equidigital number, since it uses as much as digits as its factorization.
2010011010221 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 11.
Adding to 2010011010221 its reverse (1220101100102), we get a palindrome (3230112110323).
The spelling of 2010011010221 in words is "two trillion, ten billion, eleven million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •