Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …010110010111111111011 |
3 | 10220021010200200021111222 |
4 | 100001132302302333323 |
5 | 121020024103032141 |
6 | 2201501141142255 |
7 | 142360222406603 |
oct | 20013662627773 |
9 | 3807120607458 |
10 | 1101102002171 |
11 | 394a7a413596 |
12 | 1594989ba98b |
13 | 7caab1aa372 |
14 | 3b4179a7c03 |
15 | 1d9975d014b |
hex | 1005ecb2ffb |
1101102002171 has 2 divisors, whose sum is σ = 1101102002172. Its totient is φ = 1101102002170.
The previous prime is 1101102002167. The next prime is 1101102002191. The reversal of 1101102002171 is 1712002011011.
It is a weak prime.
It is an emirp because it is prime and its reverse (1712002011011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101102002171 - 22 = 1101102002167 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101102002191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550551001085 + 550551001086.
It is an arithmetic number, because the mean of its divisors is an integer number (550551001086).
Almost surely, 21101102002171 is an apocalyptic number.
1101102002171 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101102002171 is an equidigital number, since it uses as much as digits as its factorization.
1101102002171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 1101102002171 its reverse (1712002011011), we get a palindrome (2813104013182).
The spelling of 1101102002171 in words is "one trillion, one hundred one billion, one hundred two million, two thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •