Base | Representation |
---|---|
bin | 1101011000011… |
… | …00111111101101 |
3 | 21211012221020022 |
4 | 12230030333231 |
5 | 212214011421 |
6 | 15045531525 |
7 | 2532054662 |
oct | 654147755 |
9 | 254187208 |
10 | 112250861 |
11 | 583a9808 |
12 | 31713ba5 |
13 | 1a342a38 |
14 | 10c9da69 |
15 | 9cc47ab |
hex | 6b0cfed |
112250861 has 2 divisors, whose sum is σ = 112250862. Its totient is φ = 112250860.
The previous prime is 112250849. The next prime is 112250867. The reversal of 112250861 is 168052211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60684100 + 51566761 = 7790^2 + 7181^2 .
It is an emirp because it is prime and its reverse (168052211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112250861 - 226 = 45141997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 112250861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112250867) 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, 56125430 + 56125431.
It is an arithmetic number, because the mean of its divisors is an integer number (56125431).
Almost surely, 2112250861 is an apocalyptic number.
It is an amenable number.
112250861 is a deficient number, since it is larger than the sum of its proper divisors (1).
112250861 is an equidigital number, since it uses as much as digits as its factorization.
112250861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 26.
The square root of 112250861 is about 10594.8506832329. The cubic root of 112250861 is about 482.3880717939.
The spelling of 112250861 in words is "one hundred twelve million, two hundred fifty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •