Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …010100111001111010111 |
3 | 10220011120120001101212222 |
4 | 100000203222213033113 |
5 | 121011011130013421 |
6 | 2201214503132555 |
7 | 142323515502332 |
oct | 20004352471727 |
9 | 3804516041788 |
10 | 1100110001111 |
11 | 394610463500 |
12 | 15926074415b |
13 | 7c980810ca4 |
14 | 3b361d3d619 |
15 | 1d93a47dcab |
hex | 10023aa73d7 |
1100110001111 has 12 divisors (see below), whose sum is σ = 1210230689976. Its totient is φ = 999257326320.
The previous prime is 1100110001063. The next prime is 1100110001113. The reversal of 1100110001111 is 1111000110011.
It is not a de Polignac number, because 1100110001111 - 230 = 1099036259287 is a prime.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100110001113) 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 11 ways as a sum of consecutive naturals, for example, 3686120 + ... + 3973373.
It is an arithmetic number, because the mean of its divisors is an integer number (100852557498).
Almost surely, 21100110001111 is an apocalyptic number.
1100110001111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100110001111 is a deficient number, since it is larger than the sum of its proper divisors (110120688865).
1100110001111 is a wasteful number, since it uses less digits than its factorization.
1100110001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7660702 (or 7660691 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1100110001111 its reverse (1111000110011), we get a palindrome (2211110111122).
The spelling of 1100110001111 in words is "one trillion, one hundred billion, one hundred ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •