Base | Representation |
---|---|
bin | 111011101010111… |
… | …0010100110111101 |
3 | 12011112111100110101 |
4 | 1313111302212331 |
5 | 13100030413041 |
6 | 530402041101 |
7 | 100421266522 |
oct | 16725624675 |
9 | 5145440411 |
10 | 2002201021 |
11 | 938210297 |
12 | 47a649191 |
13 | 25ba68142 |
14 | 14dcad149 |
15 | bab99b31 |
hex | 775729bd |
2002201021 has 2 divisors, whose sum is σ = 2002201022. Its totient is φ = 2002201020.
The previous prime is 2002201001. The next prime is 2002201031. The reversal of 2002201021 is 1201022002.
It is an a-pointer prime, because the next prime (2002201031) can be obtained adding 2002201021 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1959036121 + 43164900 = 44261^2 + 6570^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002201021 - 25 = 2002200989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002200989 and 2002201007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002201001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001100510 + 1001100511.
It is an arithmetic number, because the mean of its divisors is an integer number (1001100511).
Almost surely, 22002201021 is an apocalyptic number.
It is an amenable number.
2002201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002201021 is an equidigital number, since it uses as much as digits as its factorization.
2002201021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 2002201021 is about 44745.9609462128. The cubic root of 2002201021 is about 1260.3830659000.
Adding to 2002201021 its reverse (1201022002), we get a palindrome (3203223023).
The spelling of 2002201021 in words is "two billion, two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •