Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …0101000110011001000111 |
3 | 1102221121102221002011220002 |
4 | 2200010233011012121013 |
5 | 2420211402441023421 |
6 | 35221231142031515 |
7 | 2213511144456152 |
oct | 240045705063107 |
9 | 42847387064802 |
10 | 11000201111111 |
11 | 3561182830743 |
12 | 1297ab511859b |
13 | 61a411caa004 |
14 | 2a05ac166c99 |
15 | 141219182b0b |
hex | a012f146647 |
11000201111111 has 16 divisors (see below), whose sum is σ = 11257732512000. Its totient is φ = 10745229970368.
The previous prime is 11000201111059. The next prime is 11000201111129. The reversal of 11000201111111 is 11111110200011.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000201111111 is a prime.
It is a Duffinian number.
11000201111111 is a modest number, since divided by 1111111 gives 1100020 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 11000201111092 and 11000201111101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000201111311) 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, 5873240 + ... + 7516338.
It is an arithmetic number, because the mean of its divisors is an integer number (703608282000).
Almost surely, 211000201111111 is an apocalyptic number.
11000201111111 is a deficient number, since it is larger than the sum of its proper divisors (257531400889).
11000201111111 is a wasteful number, since it uses less digits than its factorization.
11000201111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1643878.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11000201111111 its reverse (11111110200011), we get a palindrome (22111311311122).
The spelling of 11000201111111 in words is "eleven trillion, two hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •