Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000000100111001010111 |
3 | 1110122210201221121200110000 |
4 | 2202333233220010321113 |
5 | 2432004122000013421 |
6 | 35453400211102343 |
7 | 2234150136044424 |
oct | 242775750047127 |
9 | 43583657550400 |
10 | 11201000001111 |
11 | 3629354544808 |
12 | 130a9b42a19b3 |
13 | 633332980a5b |
14 | 2aa1ba3a4d4b |
15 | 14656c810226 |
hex | a2fefa04e57 |
11201000001111 has 20 divisors (see below), whose sum is σ = 17272111514944. Its totient is φ = 7226451612000.
The previous prime is 11201000001053. The next prime is 11201000001161. The reversal of 11201000001111 is 11110000010211.
It is not a de Polignac number, because 11201000001111 - 26 = 11201000001047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201000001093 and 11201000001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201000001161) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2230383790 + ... + 2230388811.
Almost surely, 211201000001111 is an apocalyptic number.
11201000001111 is a deficient number, since it is larger than the sum of its proper divisors (6071111513833).
11201000001111 is an equidigital number, since it uses as much as digits as its factorization.
11201000001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4460772644 (or 4460772635 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11201000001111 its reverse (11110000010211), we get a palindrome (22311000011322).
The spelling of 11201000001111 in words is "eleven trillion, two hundred one billion, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •