Base | Representation |
---|---|
bin | 11001000010010101110011… |
… | …010011010001100010011001 |
3 | 112102212121100101000010211012 |
4 | 121002111303103101202121 |
5 | 103413033344303444321 |
6 | 1030104432020143305 |
7 | 32123221165354625 |
oct | 3102256323214231 |
9 | 472777311003735 |
10 | 110112010999961 |
11 | 320a3272660343 |
12 | 10424541837b35 |
13 | 49596972c7469 |
14 | 1d29642244185 |
15 | cae3ed14205b |
hex | 6425734d1899 |
110112010999961 has 2 divisors, whose sum is σ = 110112010999962. Its totient is φ = 110112010999960.
The previous prime is 110112010999883. The next prime is 110112010999987. The reversal of 110112010999961 is 169999010211011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99640703316361 + 10471307683600 = 9982019^2 + 3235940^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110112010999961 is a prime.
It is not a weakly prime, because it can be changed into another prime (110112010999061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056005499980 + 55056005499981.
It is an arithmetic number, because the mean of its divisors is an integer number (55056005499981).
Almost surely, 2110112010999961 is an apocalyptic number.
It is an amenable number.
110112010999961 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112010999961 is an equidigital number, since it uses as much as digits as its factorization.
110112010999961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 50.
The spelling of 110112010999961 in words is "one hundred ten trillion, one hundred twelve billion, ten million, nine hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •