Base | Representation |
---|---|
bin | 1001010001101101111110… |
… | …0000100000000111001011 |
3 | 1100010002222200122201011200 |
4 | 2110123133200200013023 |
5 | 2314104101030400021 |
6 | 33405452154155243 |
7 | 2101632364113321 |
oct | 224333740400713 |
9 | 40102880581150 |
10 | 10200002200011 |
11 | 3282884368108 |
12 | 11889b4122b23 |
13 | 58cb18a67b80 |
14 | 27397b623d11 |
15 | 12a4d369e126 |
hex | 946df8201cb |
10200002200011 has 48 divisors (see below), whose sum is σ = 16019407150656. Its totient is φ = 6216712685568.
The previous prime is 10200002200009. The next prime is 10200002200049. The reversal of 10200002200011 is 11000220000201.
It is not a de Polignac number, because 10200002200011 - 21 = 10200002200009 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 = 10200002199966 and 10200002200002.
It is not an unprimeable number, because it can be changed into a prime (10200002200111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6205746 + ... + 7675368.
It is an arithmetic number, because the mean of its divisors is an integer number (333737648972).
Almost surely, 210200002200011 is an apocalyptic number.
10200002200011 is a deficient number, since it is larger than the sum of its proper divisors (5819404950645).
10200002200011 is a wasteful number, since it uses less digits than its factorization.
10200002200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1470212 (or 1470209 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10200002200011 its reverse (11000220000201), we get a palindrome (21200222200212).
The spelling of 10200002200011 in words is "ten trillion, two hundred billion, two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •