Base | Representation |
---|---|
bin | 11001000010010110000100… |
… | …100110010011011011010101 |
3 | 112102212122002121001212221212 |
4 | 121002112010212103123111 |
5 | 103413034443101413414 |
6 | 1030104520504151205 |
7 | 32123231321133254 |
oct | 3102260446233325 |
9 | 472778077055855 |
10 | 110112301201109 |
11 | 320a34014517a9 |
12 | 10424602a68505 |
13 | 495971247410c |
14 | 1d2966c9c679b |
15 | cae41886783e |
hex | 6425849936d5 |
110112301201109 has 2 divisors, whose sum is σ = 110112301201110. Its totient is φ = 110112301201108.
The previous prime is 110112301201103. The next prime is 110112301201139. The reversal of 110112301201109 is 901102103211011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96329808300625 + 13782492900484 = 9814775^2 + 3712478^2 .
It is a cyclic number.
It is not a de Polignac number, because 110112301201109 - 224 = 110112284423893 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112301201103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056150600554 + 55056150600555.
It is an arithmetic number, because the mean of its divisors is an integer number (55056150600555).
Almost surely, 2110112301201109 is an apocalyptic number.
It is an amenable number.
110112301201109 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112301201109 is an equidigital number, since it uses as much as digits as its factorization.
110112301201109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
The spelling of 110112301201109 in words is "one hundred ten trillion, one hundred twelve billion, three hundred one million, two hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •