Base | Representation |
---|---|
bin | 11101001000101101000… |
… | …101010101001100111101 |
3 | 21002102001112111000011001 |
4 | 131020231011111030331 |
5 | 230301012022212341 |
6 | 4131445245130301 |
7 | 264440441550466 |
oct | 35105505251475 |
9 | 7072045430131 |
10 | 2002211132221 |
11 | 702150a94193 |
12 | 284060559991 |
13 | 116a66692a31 |
14 | 6cc9c3c7d6d |
15 | 37137197d31 |
hex | 1d22d15533d |
2002211132221 has 4 divisors (see below), whose sum is σ = 2002228886812. Its totient is φ = 2002193377632.
The previous prime is 2002211132177. The next prime is 2002211132231. The reversal of 2002211132221 is 1222311122002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 455456265625 + 1546754866596 = 674875^2 + 1243686^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002211132221 - 225 = 2002177577789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002211132231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8707050 + ... + 8934043.
It is an arithmetic number, because the mean of its divisors is an integer number (500557221703).
Almost surely, 22002211132221 is an apocalyptic number.
It is an amenable number.
2002211132221 is a deficient number, since it is larger than the sum of its proper divisors (17754591).
2002211132221 is a wasteful number, since it uses less digits than its factorization.
2002211132221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17754590.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2002211132221 its reverse (1222311122002), we get a palindrome (3224522254223).
The spelling of 2002211132221 in words is "two trillion, two billion, two hundred eleven million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •