Base | Representation |
---|---|
bin | 1101011100100… |
… | …00100000100101 |
3 | 21212020022011102 |
4 | 12232100200211 |
5 | 212333231131 |
6 | 15105245445 |
7 | 2536460324 |
oct | 656204045 |
9 | 255208142 |
10 | 112789541 |
11 | 587374a7 |
12 | 31933885 |
13 | 1a4a0c97 |
14 | 10da00bb |
15 | 9d7e1cb |
hex | 6b90825 |
112789541 has 4 divisors (see below), whose sum is σ = 112869900. Its totient is φ = 112709184.
The previous prime is 112789531. The next prime is 112789553. The reversal of 112789541 is 145987211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61952641 + 50836900 = 7871^2 + 7130^2 .
It is a cyclic number.
It is not a de Polignac number, because 112789541 - 222 = 108595237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112789495 and 112789504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112789531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38036 + ... + 40893.
It is an arithmetic number, because the mean of its divisors is an integer number (28217475).
Almost surely, 2112789541 is an apocalyptic number.
It is an amenable number.
112789541 is a deficient number, since it is larger than the sum of its proper divisors (80359).
112789541 is an equidigital number, since it uses as much as digits as its factorization.
112789541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80358.
The product of its digits is 20160, while the sum is 38.
The square root of 112789541 is about 10620.2420405563. The cubic root of 112789541 is about 483.1584838281.
The spelling of 112789541 in words is "one hundred twelve million, seven hundred eighty-nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •