Base | Representation |
---|---|
bin | 110100001010011100… |
… | …1110110011001111011 |
3 | 101201010212010110010011 |
4 | 1220110321312121323 |
5 | 3313404040442232 |
6 | 123243342202351 |
7 | 11043646043254 |
oct | 1502471663173 |
9 | 351125113104 |
10 | 112019859067 |
11 | 43564321126 |
12 | 198632833b7 |
13 | a742b0849c |
14 | 55c956bb2b |
15 | 2da95ce547 |
hex | 1a14e7667b |
112019859067 has 2 divisors, whose sum is σ = 112019859068. Its totient is φ = 112019859066.
The previous prime is 112019859047. The next prime is 112019859073. The reversal of 112019859067 is 760958910211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112019859067 is a prime.
It is a super-2 number, since 2×1120198590672 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112019859067.
It is not a weakly prime, because it can be changed into another prime (112019859047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56009929533 + 56009929534.
It is an arithmetic number, because the mean of its divisors is an integer number (56009929534).
Almost surely, 2112019859067 is an apocalyptic number.
112019859067 is a deficient number, since it is larger than the sum of its proper divisors (1).
112019859067 is an equidigital number, since it uses as much as digits as its factorization.
112019859067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 49.
The spelling of 112019859067 in words is "one hundred twelve billion, nineteen million, eight hundred fifty-nine thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •