Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …110011111010100110101111 |
3 | 112102212121121222112002122202 |
4 | 121002111321303322212233 |
5 | 103413034110234020304 |
6 | 1030104450521132115 |
7 | 32123223662620625 |
oct | 3102257163724657 |
9 | 472777558462582 |
10 | 110112120220079 |
11 | 320a3319279aaa |
12 | 1042457232a03b |
13 | 49596b3b18853 |
14 | 1d29652955515 |
15 | cae407a1881e |
hex | 642579cfa9af |
110112120220079 has 2 divisors, whose sum is σ = 110112120220080. Its totient is φ = 110112120220078.
The previous prime is 110112120220051. The next prime is 110112120220121. The reversal of 110112120220079 is 970022021211011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110112120220079 - 28 = 110112120219823 is a prime.
It is a super-2 number, since 2×1101121202200792 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112120220009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056060110039 + 55056060110040.
It is an arithmetic number, because the mean of its divisors is an integer number (55056060110040).
Almost surely, 2110112120220079 is an apocalyptic number.
110112120220079 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112120220079 is an equidigital number, since it uses as much as digits as its factorization.
110112120220079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 29.
The spelling of 110112120220079 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty million, two hundred twenty thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •