Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …110010100010010011011 |
3 | 21002102000222011221121011 |
4 | 131020230212110102123 |
5 | 230301002432031021 |
6 | 4131444354554351 |
7 | 264440312466322 |
oct | 35105446242233 |
9 | 7072028157534 |
10 | 2002203002011 |
11 | 702147440903 |
12 | 2840598989b7 |
13 | 116a64aa7264 |
14 | 6cc9b2ad0b9 |
15 | 371365ddde1 |
hex | 1d22c99449b |
2002203002011 has 16 divisors (see below), whose sum is σ = 2121167865600. Its totient is φ = 1884607064928.
The previous prime is 2002203001993. The next prime is 2002203002053. The reversal of 2002203002011 is 1102003022002.
It is a cyclic number.
It is not a de Polignac number, because 2002203002011 - 25 = 2002203001979 is a prime.
It is a super-2 number, since 2×20022030020112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002203001982 and 2002203002000.
It is not an unprimeable number, because it can be changed into a prime (2002203002071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6879280 + ... + 7164418.
It is an arithmetic number, because the mean of its divisors is an integer number (132572991600).
Almost surely, 22002203002011 is an apocalyptic number.
2002203002011 is a deficient number, since it is larger than the sum of its proper divisors (118964863589).
2002203002011 is a wasteful number, since it uses less digits than its factorization.
2002203002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287538.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 2002203002011 its reverse (1102003022002), we get a palindrome (3104206024013).
The spelling of 2002203002011 in words is "two trillion, two billion, two hundred three million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •