Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …100111111010111110001 |
3 | 10220011121022221210102100 |
4 | 100000210110333113301 |
5 | 121011022001010001 |
6 | 2201215541211013 |
7 | 142324012100634 |
oct | 20004424772761 |
9 | 3804538853370 |
10 | 1100121110001 |
11 | 394616760801 |
12 | 159264400a69 |
13 | 7c982c004b4 |
14 | 3b3635d1c1b |
15 | 1d93b425586 |
hex | 1002453f5f1 |
1100121110001 has 12 divisors (see below), whose sum is σ = 1632011497012. Its totient is φ = 713592071136.
The previous prime is 1100121109987. The next prime is 1100121110017. The reversal of 1100121110001 is 1000111210011.
It can be written as a sum of positive squares in 2 ways, for example, as 1007734899600 + 92386210401 = 1003860^2 + 303951^2 .
It is not a de Polignac number, because 1100121110001 - 213 = 1100121101809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100121110051) 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, 1651833166 + ... + 1651833831.
Almost surely, 21100121110001 is an apocalyptic number.
It is an amenable number.
1100121110001 is a deficient number, since it is larger than the sum of its proper divisors (531890387011).
1100121110001 is a wasteful number, since it uses less digits than its factorization.
1100121110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3303667040 (or 3303667037 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100121110001 its reverse (1000111210011), we get a palindrome (2100232320012).
It can be divided in two parts, 1100121 and 110001, that multiplied together give a palindrome (121014410121).
The spelling of 1100121110001 in words is "one trillion, one hundred billion, one hundred twenty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •