Base | Representation |
---|---|
bin | 10000000000100100111… |
… | …110111010011110110001 |
3 | 10220011122002122010212222 |
4 | 100000210332322132301 |
5 | 121011032304200032 |
6 | 2201221012530425 |
7 | 142324204362536 |
oct | 20004476723661 |
9 | 3804562563788 |
10 | 1100132100017 |
11 | 394621987765 |
12 | 159268020a15 |
13 | 7c98527a872 |
14 | 3b364c52d8d |
15 | 1d93c396a12 |
hex | 10024fba7b1 |
1100132100017 has 2 divisors, whose sum is σ = 1100132100018. Its totient is φ = 1100132100016.
The previous prime is 1100132099993. The next prime is 1100132100059. The reversal of 1100132100017 is 7100012310011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 580650096016 + 519482004001 = 762004^2 + 720751^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100132100017 - 218 = 1100131837873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100132099968 and 1100132100004.
It is not a weakly prime, because it can be changed into another prime (1100132100077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550066050008 + 550066050009.
It is an arithmetic number, because the mean of its divisors is an integer number (550066050009).
Almost surely, 21100132100017 is an apocalyptic number.
It is an amenable number.
1100132100017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100132100017 is an equidigital number, since it uses as much as digits as its factorization.
1100132100017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 17.
Adding to 1100132100017 its reverse (7100012310011), we get a palindrome (8200144410028).
The spelling of 1100132100017 in words is "one trillion, one hundred billion, one hundred thirty-two million, one hundred thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •