Base | Representation |
---|---|
bin | 110100100100011011… |
… | …0101101010010000011 |
3 | 101210101121011212210022 |
4 | 1221020312231102003 |
5 | 3322200202403444 |
6 | 123510035324055 |
7 | 11104361332202 |
oct | 1511066552203 |
9 | 353347155708 |
10 | 112891450499 |
11 | 4397130a723 |
12 | 19a6715062b |
13 | a851566369 |
14 | 566d211239 |
15 | 2e0ad989ee |
hex | 1a48dad483 |
112891450499 has 2 divisors, whose sum is σ = 112891450500. Its totient is φ = 112891450498.
The previous prime is 112891450489. The next prime is 112891450543. The reversal of 112891450499 is 994054198211.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112891450499 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112891450499.
It is not a weakly prime, because it can be changed into another prime (112891450429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56445725249 + 56445725250.
It is an arithmetic number, because the mean of its divisors is an integer number (56445725250).
Almost surely, 2112891450499 is an apocalyptic number.
112891450499 is a deficient number, since it is larger than the sum of its proper divisors (1).
112891450499 is an equidigital number, since it uses as much as digits as its factorization.
112891450499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 53.
The spelling of 112891450499 in words is "one hundred twelve billion, eight hundred ninety-one million, four hundred fifty thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •