Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …11110100000101111011 |
3 | 10112201001011011122212200 |
4 | 32210112313310011323 |
5 | 112400233421010021 |
6 | 2043523141241243 |
7 | 132220316013555 |
oct | 16442667640573 |
9 | 3481034148780 |
10 | 1001111110011 |
11 | 356629139331 |
12 | 142032103223 |
13 | 7353453939c |
14 | 3664dc384d5 |
15 | 1b094094126 |
hex | e916df417b |
1001111110011 has 12 divisors (see below), whose sum is σ = 1495913153280. Its totient is φ = 644393358000.
The previous prime is 1001111109989. The next prime is 1001111110039. The reversal of 1001111110011 is 1100111111001.
It is not a de Polignac number, because 1001111110011 - 29 = 1001111109499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1001111109975 and 1001111110002.
It is not an unprimeable number, because it can be changed into a prime (1001111110091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1917837115 + ... + 1917837636.
It is an arithmetic number, because the mean of its divisors is an integer number (124659429440).
Almost surely, 21001111110011 is an apocalyptic number.
1001111110011 is a deficient number, since it is larger than the sum of its proper divisors (494802043269).
1001111110011 is a wasteful number, since it uses less digits than its factorization.
1001111110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3835674786 (or 3835674783 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1001111110011 its reverse (1100111111001), we get a palindrome (2101222221012).
The spelling of 1001111110011 in words is "one trillion, one billion, one hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •