Base | Representation |
---|---|
bin | 11001000011100110110101… |
… | …000111100000011001010111 |
3 | 112110011220220210112210022122 |
4 | 121003212311013200121113 |
5 | 103421000040211313041 |
6 | 1030212421200250155 |
7 | 32132421211402643 |
oct | 3103466507403127 |
9 | 473156823483278 |
10 | 110199014557271 |
11 | 32127159920712 |
12 | 1043938301095b |
13 | 49649513ac413 |
14 | 1d2d9371c3c23 |
15 | cb17e13cdc4b |
hex | 6439b51e0657 |
110199014557271 has 2 divisors, whose sum is σ = 110199014557272. Its totient is φ = 110199014557270.
The previous prime is 110199014557223. The next prime is 110199014557349. The reversal of 110199014557271 is 172755410991011.
It is a weak prime.
It is an emirp because it is prime and its reverse (172755410991011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110199014557271 is a prime.
It is a super-3 number, since 3×1101990145572713 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110199014554271) 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, 55099507278635 + 55099507278636.
It is an arithmetic number, because the mean of its divisors is an integer number (55099507278636).
Almost surely, 2110199014557271 is an apocalyptic number.
110199014557271 is a deficient number, since it is larger than the sum of its proper divisors (1).
110199014557271 is an equidigital number, since it uses as much as digits as its factorization.
110199014557271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 793800, while the sum is 53.
The spelling of 110199014557271 in words is "one hundred ten trillion, one hundred ninety-nine billion, fourteen million, five hundred fifty-seven thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •