Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …00000000001100100011 |
3 | 10112201001002021220111200 |
4 | 32210112310000030203 |
5 | 112400233142023021 |
6 | 2043523104012243 |
7 | 132220304353203 |
oct | 16442664001443 |
9 | 3481032256450 |
10 | 1001110111011 |
11 | 35662861680a |
12 | 142031901083 |
13 | 7353427976a |
14 | 3664da58403 |
15 | 1b093e48126 |
hex | e916d00323 |
1001110111011 has 12 divisors (see below), whose sum is σ = 1446274709880. Its totient is φ = 667302076800.
The previous prime is 1001110110971. The next prime is 1001110111061. The reversal of 1001110111011 is 1101110111001.
It is not a de Polignac number, because 1001110111011 - 214 = 1001110094627 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 = 1001110110984 and 1001110111002.
It is not an unprimeable number, because it can be changed into a prime (1001110111061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8661390 + ... + 8776211.
It is an arithmetic number, because the mean of its divisors is an integer number (120522892490).
Almost surely, 21001110111011 is an apocalyptic number.
1001110111011 is a deficient number, since it is larger than the sum of its proper divisors (445164598869).
1001110111011 is a wasteful number, since it uses less digits than its factorization.
1001110111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17443986 (or 17443983 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1001110111011 its reverse (1101110111001), we get a palindrome (2102220222012).
It can be divided in two parts, 1001 and 110111011, that multiplied together give a palindrome (110221122011).
The spelling of 1001110111011 in words is "one trillion, one billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •