Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …011001111000100100001 |
3 | 10220021010112221120111021 |
4 | 100001132223033010201 |
5 | 121020023101120001 |
6 | 2201501030445441 |
7 | 142360166512642 |
oct | 20013653170441 |
9 | 3807115846437 |
10 | 1101100020001 |
11 | 394a7928a333 |
12 | 159498203881 |
13 | 7caaa965097 |
14 | 3b41760d6c9 |
15 | 1d99733cba1 |
hex | 1005eacf121 |
1101100020001 has 2 divisors, whose sum is σ = 1101100020002. Its totient is φ = 1101100020000.
The previous prime is 1101100019947. The next prime is 1101100020011. The reversal of 1101100020001 is 1000200011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 700486976401 + 400613043600 = 836951^2 + 632940^2 .
It is an emirp because it is prime and its reverse (1000200011011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101100020001 - 227 = 1100965802273 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101100020011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550010000 + 550550010001.
It is an arithmetic number, because the mean of its divisors is an integer number (550550010001).
Almost surely, 21101100020001 is an apocalyptic number.
It is an amenable number.
1101100020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101100020001 is an equidigital number, since it uses as much as digits as its factorization.
1101100020001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1101100020001 its reverse (1000200011011), we get a palindrome (2101300031012).
The spelling of 1101100020001 in words is "one trillion, one hundred one billion, one hundred million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •