Base | Representation |
---|---|
bin | 11101001000101101110… |
… | …11001101100111110011 |
3 | 10112201001012211221002200 |
4 | 32210112323031213303 |
5 | 112400234133013021 |
6 | 2043523212314243 |
7 | 132220326414333 |
oct | 16442673154763 |
9 | 3481035757080 |
10 | 1001112001011 |
11 | 3566296977a1 |
12 | 142032472983 |
13 | 7353478bac5 |
14 | 3664ddcb0c3 |
15 | 1b0941bd126 |
hex | e916ecd9f3 |
1001112001011 has 12 divisors (see below), whose sum is σ = 1446190423392. Its totient is φ = 667343498256.
The previous prime is 1001112001009. The next prime is 1001112001013. The reversal of 1001112001011 is 1101002111001.
It is an interprime number because it is at equal distance from previous prime (1001112001009) and next prime (1001112001013).
It is not a de Polignac number, because 1001112001011 - 21 = 1001112001009 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 = 1001112000984 and 1001112001002.
It is not an unprimeable number, because it can be changed into a prime (1001112001013) 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, 5276811 + ... + 5463236.
It is an arithmetic number, because the mean of its divisors is an integer number (120515868616).
Almost surely, 21001112001011 is an apocalyptic number.
1001112001011 is a deficient number, since it is larger than the sum of its proper divisors (445078422381).
1001112001011 is a wasteful number, since it uses less digits than its factorization.
1001112001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10750410 (or 10750407 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1001112001011 its reverse (1101002111001), we get a palindrome (2102114112012).
The spelling of 1001112001011 in words is "one trillion, one billion, one hundred twelve million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •