Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …011100011000101110001 |
3 | 10220021010120002201222022 |
4 | 100001132223203011301 |
5 | 121020023111231001 |
6 | 2201501032321225 |
7 | 142360200304004 |
oct | 20013653430561 |
9 | 3807116081868 |
10 | 1101100102001 |
11 | 394a793359a9 |
12 | 159498243215 |
13 | 7caaa9934c3 |
14 | 3b41763153b |
15 | 1d99735711b |
hex | 1005eae3171 |
1101100102001 has 2 divisors, whose sum is σ = 1101100102002. Its totient is φ = 1101100102000.
The previous prime is 1101100101929. The next prime is 1101100102043. The reversal of 1101100102001 is 1002010011011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 578550390625 + 522549711376 = 760625^2 + 722876^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101100102001 - 234 = 1083920232817 is a prime.
It is a super-2 number, since 2×11011001020012 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1101100102001.
It is not a weakly prime, because it can be changed into another prime (1101100102801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550051000 + 550550051001.
It is an arithmetic number, because the mean of its divisors is an integer number (550550051001).
Almost surely, 21101100102001 is an apocalyptic number.
It is an amenable number.
1101100102001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101100102001 is an equidigital number, since it uses as much as digits as its factorization.
1101100102001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1101100102001 its reverse (1002010011011), we get a palindrome (2103110113012).
The spelling of 1101100102001 in words is "one trillion, one hundred one billion, one hundred million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •