Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …1111010100001100100111 |
3 | 1110100010010202112212020222 |
4 | 2201223012033110030213 |
5 | 2424012002000043421 |
6 | 35343525323314555 |
7 | 2224451626101302 |
oct | 241530617241447 |
9 | 43303122485228 |
10 | 11110111331111 |
11 | 35a385422a801 |
12 | 12b526997ba5b |
13 | 6278a9a01150 |
14 | 2a5a37459b39 |
15 | 143eed443cab |
hex | a1ac63d4327 |
11110111331111 has 8 divisors (see below), whose sum is σ = 11964837937920. Its totient is φ = 10255399389792.
The previous prime is 11110111331071. The next prime is 11110111331171. The reversal of 11110111331111 is 11113311101111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11110111331111 - 218 = 11110111068967 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11110111331111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110111331171) 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, 2067116 + ... + 5147153.
It is an arithmetic number, because the mean of its divisors is an integer number (1495604742240).
Almost surely, 211110111331111 is an apocalyptic number.
11110111331111 is a deficient number, since it is larger than the sum of its proper divisors (854726606809).
11110111331111 is a wasteful number, since it uses less digits than its factorization.
11110111331111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7332745.
The product of its (nonzero) digits is 9, while the sum is 17.
Adding to 11110111331111 its reverse (11113311101111), we get a palindrome (22223422432222).
The spelling of 11110111331111 in words is "eleven trillion, one hundred ten billion, one hundred eleven million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •