Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …011000001110100010011 |
3 | 10220011120120020221012211 |
4 | 100000203223001310103 |
5 | 121011011142004341 |
6 | 2201214505332551 |
7 | 142323516434605 |
oct | 20004353016423 |
9 | 3804516227184 |
10 | 1100110109971 |
11 | 394610528274 |
12 | 159260797157 |
13 | 7c98084b6c2 |
14 | 3b361d6b175 |
15 | 1d93a4a1181 |
hex | 10023ac1d13 |
1100110109971 has 2 divisors, whose sum is σ = 1100110109972. Its totient is φ = 1100110109970.
The previous prime is 1100110109951. The next prime is 1100110110031. The reversal of 1100110109971 is 1799010110011.
It is a weak prime.
It is an emirp because it is prime and its reverse (1799010110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100110109971 - 211 = 1100110107923 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100110109911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055054985 + 550055054986.
It is an arithmetic number, because the mean of its divisors is an integer number (550055054986).
Almost surely, 21100110109971 is an apocalyptic number.
1100110109971 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100110109971 is an equidigital number, since it uses as much as digits as its factorization.
1100110109971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
Adding to 1100110109971 its reverse (1799010110011), we get a palindrome (2899120219982).
The spelling of 1100110109971 in words is "one trillion, one hundred billion, one hundred ten million, one hundred nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •