Base | Representation |
---|---|
bin | 11101001010101111100… |
… | …10010111001101001011 |
3 | 10112210212001111011111100 |
4 | 32211113302113031023 |
5 | 112410001222400021 |
6 | 2044223204232443 |
7 | 132256312100223 |
oct | 16452762271513 |
9 | 3483761434440 |
10 | 1002200200011 |
11 | 35703798180a |
12 | 14229699b723 |
13 | 7367906a23a |
14 | 36714737083 |
15 | 1b1099c2626 |
hex | e957c9734b |
1002200200011 has 24 divisors (see below), whose sum is σ = 1461245900400. Its totient is φ = 661869798336.
The previous prime is 1002200200009. The next prime is 1002200200019. The reversal of 1002200200011 is 1100020022001.
It is not a de Polignac number, because 1002200200011 - 21 = 1002200200009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1002200199966 and 1002200200002.
It is not an unprimeable number, because it can be changed into a prime (1002200200019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 501621 + ... + 1502006.
It is an arithmetic number, because the mean of its divisors is an integer number (60885245850).
Almost surely, 21002200200011 is an apocalyptic number.
1002200200011 is a deficient number, since it is larger than the sum of its proper divisors (459045700389).
1002200200011 is a wasteful number, since it uses less digits than its factorization.
1002200200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2004155 (or 2004152 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1002200200011 its reverse (1100020022001), we get a palindrome (2102220222012).
The spelling of 1002200200011 in words is "one trillion, two billion, two hundred million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •