Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …1001111011001001110111 |
3 | 1102221121012120211101122100 |
4 | 2200010221221323021313 |
5 | 2420211211141213421 |
6 | 35221214131233143 |
7 | 2213505661055655 |
oct | 240045151731167 |
9 | 42847176741570 |
10 | 11000110101111 |
11 | 356113641a56a |
12 | 1297a8a7487b3 |
13 | 61a3c9193441 |
14 | 2a05a0035dd5 |
15 | 1412111a6c26 |
hex | a0129a7b277 |
11000110101111 has 24 divisors (see below), whose sum is σ = 16326034076144. Its totient is φ = 7131904277760.
The previous prime is 11000110101107. The next prime is 11000110101119. The reversal of 11000110101111 is 11110101100011.
It is not a de Polignac number, because 11000110101111 - 22 = 11000110101107 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 = 11000110101093 and 11000110101102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000110101119) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6923461 + ... + 8362686.
Almost surely, 211000110101111 is an apocalyptic number.
11000110101111 is a deficient number, since it is larger than the sum of its proper divisors (5325923975033).
11000110101111 is a wasteful number, since it uses less digits than its factorization.
11000110101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15288351 (or 15288348 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11000110101111 its reverse (11110101100011), we get a palindrome (22110211201122).
It can be divided in two parts, 110001 and 10101111, that multiplied together give a palindrome (1111132311111).
The spelling of 11000110101111 in words is "eleven trillion, one hundred ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •