Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …1010101010000110011111 |
3 | 1110100010010200020211100202 |
4 | 2201223012022222012133 |
5 | 2424012001142010421 |
6 | 35343525241214115 |
7 | 2224451612524445 |
oct | 241530612520637 |
9 | 43303120224322 |
10 | 11110110110111 |
11 | 35a3853576411 |
12 | 12b526949133b |
13 | 6278a969446c |
14 | 2a5a3721cb95 |
15 | 143eed2a210b |
hex | a1ac62aa19f |
11110110110111 has 8 divisors (see below), whose sum is σ = 11596651422720. Its totient is φ = 10623859884792.
The previous prime is 11110110110083. The next prime is 11110110110159. The reversal of 11110110110111 is 11101101101111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110110110111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11110110110092 and 11110110110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110110110611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72693815 + ... + 72846488.
It is an arithmetic number, because the mean of its divisors is an integer number (1449581427840).
Almost surely, 211110110110111 is an apocalyptic number.
11110110110111 is a deficient number, since it is larger than the sum of its proper divisors (486541312609).
11110110110111 is a wasteful number, since it uses less digits than its factorization.
11110110110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145543645.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 11110110110111 its reverse (11101101101111), we get a palindrome (22211211211222).
The spelling of 11110110110111 in words is "eleven trillion, one hundred ten billion, one hundred ten million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •