Base | Representation |
---|---|
bin | 10000010100001101010… |
… | …101011110111111001011 |
3 | 10222012001001210120022010 |
4 | 100110031111132333023 |
5 | 121332214302400021 |
6 | 2215024333431003 |
7 | 144001430311236 |
oct | 20241525367713 |
9 | 3865031716263 |
10 | 1121210200011 |
11 | 3a2558a23210 |
12 | 16136b03b463 |
13 | 81964108c95 |
14 | 3c3a43b641d |
15 | 1e272abe976 |
hex | 1050d55efcb |
1121210200011 has 16 divisors (see below), whose sum is σ = 1640616784128. Its totient is φ = 675452340000.
The previous prime is 1121210199997. The next prime is 1121210200031. The reversal of 1121210200011 is 1100020121211.
It is not a de Polignac number, because 1121210200011 - 27 = 1121210199883 is a prime.
It is a super-2 number, since 2×11212102000112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121210200011.
It is not an unprimeable number, because it can be changed into a prime (1121210200031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101719240 + ... + 101730261.
It is an arithmetic number, because the mean of its divisors is an integer number (102538549008).
Almost surely, 21121210200011 is an apocalyptic number.
1121210200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1121210200011 is a deficient number, since it is larger than the sum of its proper divisors (519406584117).
1121210200011 is a wasteful number, since it uses less digits than its factorization.
1121210200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203449682.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1121210200011 its reverse (1100020121211), we get a palindrome (2221230321222).
The spelling of 1121210200011 in words is "one trillion, one hundred twenty-one billion, two hundred ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •