Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …101000110011110001101111 |
3 | 112102212111202121110200212001 |
4 | 121002110313220303301233 |
5 | 103413024322030343041 |
6 | 1030104144421353131 |
7 | 32123154322201312 |
oct | 3102246750636157 |
9 | 472774677420761 |
10 | 110111010012271 |
11 | 320a28a9622494 |
12 | 104243025687a7 |
13 | 4959567b02858 |
14 | 1d2958931a979 |
15 | cae390318131 |
hex | 642537a33c6f |
110111010012271 has 2 divisors, whose sum is σ = 110111010012272. Its totient is φ = 110111010012270.
The previous prime is 110111010012217. The next prime is 110111010012319. The reversal of 110111010012271 is 172210010111011.
Together with previous prime (110111010012217) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111010012271 - 211 = 110111010010223 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111010012071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055505006135 + 55055505006136.
It is an arithmetic number, because the mean of its divisors is an integer number (55055505006136).
Almost surely, 2110111010012271 is an apocalyptic number.
110111010012271 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111010012271 is an equidigital number, since it uses as much as digits as its factorization.
110111010012271 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 19.
Adding to 110111010012271 its reverse (172210010111011), we get a palindrome (282321020123282).
The spelling of 110111010012271 in words is "one hundred ten trillion, one hundred eleven billion, ten million, twelve thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •