Base | Representation |
---|---|
bin | 11101001000100110100… |
… | …010000000110001101101 |
3 | 21002101202212122101111212 |
4 | 131020212202000301231 |
5 | 230300300402211341 |
6 | 4131430321124205 |
7 | 264434635332260 |
oct | 35104642006155 |
9 | 7071685571455 |
10 | 2002101210221 |
11 | 7020a4a36162 |
12 | 28402b789665 |
13 | 116a49987028 |
14 | 6cc8b972cd7 |
15 | 3712c6d35eb |
hex | 1d226880c6d |
2002101210221 has 16 divisors (see below), whose sum is σ = 2295144220800. Its totient is φ = 1710823403520.
The previous prime is 2002101210139. The next prime is 2002101210247. The reversal of 2002101210221 is 1220121012002.
It is not a de Polignac number, because 2002101210221 - 234 = 1984921341037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002101210196 and 2002101210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002101210251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2649005 + ... + 3319853.
It is an arithmetic number, because the mean of its divisors is an integer number (143446513800).
Almost surely, 22002101210221 is an apocalyptic number.
It is an amenable number.
2002101210221 is a deficient number, since it is larger than the sum of its proper divisors (293043010579).
2002101210221 is an equidigital number, since it uses as much as digits as its factorization.
2002101210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672164.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2002101210221 its reverse (1220121012002), we get a palindrome (3222222222223).
The spelling of 2002101210221 in words is "two trillion, two billion, one hundred one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •