Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …1110000110000010111001 |
3 | 1110100010010201221121011001 |
4 | 2201223012032012002321 |
5 | 2424012001404323001 |
6 | 35343525312405001 |
7 | 2224451623266112 |
oct | 241530616060271 |
9 | 43303121847131 |
10 | 11110111011001 |
11 | 35a3854031252 |
12 | 12b5269846761 |
13 | 6278a991b532 |
14 | 2a5a373b5209 |
15 | 143eed3ce001 |
hex | a1ac63860b9 |
11110111011001 has 8 divisors (see below), whose sum is σ = 11364720450560. Its totient is φ = 10858112950608.
The previous prime is 11110111010993. The next prime is 11110111011007. The reversal of 11110111011001 is 10011011101111.
It is a happy number.
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 11110111011001 - 23 = 11110111010993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110111011007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 652836186 + ... + 652853203.
It is an arithmetic number, because the mean of its divisors is an integer number (1420590056320).
Almost surely, 211110111011001 is an apocalyptic number.
It is an amenable number.
11110111011001 is a deficient number, since it is larger than the sum of its proper divisors (254609439559).
11110111011001 is a wasteful number, since it uses less digits than its factorization.
11110111011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1305689583.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 11110111011001 its reverse (10011011101111), we get a palindrome (21121122112112).
The spelling of 11110111011001 in words is "eleven trillion, one hundred ten billion, one hundred eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •