Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0001010110111100011001 |
3 | 1110100012201100221010200202 |
4 | 2201230001301112330121 |
5 | 2424021023142023001 |
6 | 35344212402511545 |
7 | 2224515444431105 |
oct | 241540161267431 |
9 | 43305640833622 |
10 | 11111110111001 |
11 | 35a4216a9a92a |
12 | 12b54a83655b5 |
13 | 627a08901b74 |
14 | 2a5acdd6a905 |
15 | 14405ae8396b |
hex | a1b01c56f19 |
11111110111001 has 8 divisors (see below), whose sum is σ = 11154555157224. Its totient is φ = 11067692751360.
The previous prime is 11111110110979. The next prime is 11111110111009. The reversal of 11111110111001 is 10011101111111.
It can be written as a sum of positive squares in 4 ways, for example, as 3665306421001 + 7445803690000 = 1914499^2 + 2728700^2 .
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 11111110111001 - 242 = 6713063599897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11111110111009) 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, 6117260 + ... + 7722893.
It is an arithmetic number, because the mean of its divisors is an integer number (1394319394653).
Almost surely, 211111110111001 is an apocalyptic number.
It is an amenable number.
11111110111001 is a deficient number, since it is larger than the sum of its proper divisors (43445046223).
11111110111001 is a wasteful number, since it uses less digits than its factorization.
11111110111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13843291.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 11111110111001 its reverse (10011101111111), we get a palindrome (21122211222112).
The spelling of 11111110111001 in words is "eleven trillion, one hundred eleven billion, one hundred ten million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •