Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100100000111100011001 |
3 | 10220011120000012112200200 |
4 | 100000203030200330121 |
5 | 121011002120023001 |
6 | 2201214022052413 |
7 | 142323361441155 |
oct | 20004314407431 |
9 | 3804500175620 |
10 | 1100102111001 |
11 | 394606a64553 |
12 | 159259b7a109 |
13 | 7c97bcaa89a |
14 | 3b360c88065 |
15 | 1d939921086 |
hex | 10023320f19 |
1100102111001 has 24 divisors (see below), whose sum is σ = 1640466097920. Its totient is φ = 709669533600.
The previous prime is 1100102110993. The next prime is 1100102111023. The reversal of 1100102111001 is 1001112010011.
It is not a de Polignac number, because 1100102111001 - 23 = 1100102110993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1100102111081) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2550691 + ... + 2950631.
It is an arithmetic number, because the mean of its divisors is an integer number (68352754080).
Almost surely, 21100102111001 is an apocalyptic number.
It is an amenable number.
1100102111001 is a deficient number, since it is larger than the sum of its proper divisors (540363986919).
1100102111001 is a wasteful number, since it uses less digits than its factorization.
1100102111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 409837 (or 409834 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100102111001 its reverse (1001112010011), we get a palindrome (2101214121012).
The spelling of 1100102111001 in words is "one trillion, one hundred billion, one hundred two million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •