Base | Representation |
---|---|
bin | 11101001111111110000… |
… | …111001101111100011101 |
3 | 21010011012021010120221022 |
4 | 131033332013031330131 |
5 | 230413001314012341 |
6 | 4135215351013525 |
7 | 265134665605565 |
oct | 35177607157435 |
9 | 7104167116838 |
10 | 2010013032221 |
11 | 705494a57127 |
12 | 28567936a2a5 |
13 | 11770ab655cc |
14 | 6d3dc645da5 |
15 | 374420b1e4b |
hex | 1d3fe1cdf1d |
2010013032221 has 2 divisors, whose sum is σ = 2010013032222. Its totient is φ = 2010013032220.
The previous prime is 2010013032179. The next prime is 2010013032233. The reversal of 2010013032221 is 1222303100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1108937469721 + 901075562500 = 1053061^2 + 949250^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010013032221 - 214 = 2010013015837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010013032221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010013032721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005006516110 + 1005006516111.
It is an arithmetic number, because the mean of its divisors is an integer number (1005006516111).
Almost surely, 22010013032221 is an apocalyptic number.
It is an amenable number.
2010013032221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010013032221 is an equidigital number, since it uses as much as digits as its factorization.
2010013032221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2010013032221 its reverse (1222303100102), we get a palindrome (3232316132323).
The spelling of 2010013032221 in words is "two trillion, ten billion, thirteen million, thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •