Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …011100110111111011011 |
3 | 10221020012102211211011001 |
4 | 100022320223212333123 |
5 | 121201214200031021 |
6 | 2210251144245431 |
7 | 143165400113431 |
oct | 20127053467733 |
9 | 3836172754131 |
10 | 1111200002011 |
11 | 399291483300 |
12 | 15b436770877 |
13 | 80a2a28aab8 |
14 | 3bad4b5ad51 |
15 | 1dd88d9a091 |
hex | 102b8ae6fdb |
1111200002011 has 12 divisors (see below), whose sum is σ = 1222379725000. Its totient is φ = 1009372890240.
The previous prime is 1111200001999. The next prime is 1111200002023. The reversal of 1111200002011 is 1102000021111.
It is an interprime number because it is at equal distance from previous prime (1111200001999) and next prime (1111200002023).
It is not a de Polignac number, because 1111200002011 - 211 = 1111199999963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111200042011) 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 11 ways as a sum of consecutive naturals, for example, 3525201 + ... + 3827458.
Almost surely, 21111200002011 is an apocalyptic number.
1111200002011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1111200002011 is a deficient number, since it is larger than the sum of its proper divisors (111179722989).
1111200002011 is a wasteful number, since it uses less digits than its factorization.
1111200002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7353930 (or 7353919 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1111200002011 its reverse (1102000021111), we get a palindrome (2213200023122).
The spelling of 1111200002011 in words is "one trillion, one hundred eleven billion, two hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •