Base | Representation |
---|---|
bin | 1101011011101… |
… | …11000101110101 |
3 | 21212001000100102 |
4 | 12231313011311 |
5 | 212321413204 |
6 | 15103123445 |
7 | 2535544643 |
oct | 655670565 |
9 | 255030312 |
10 | 112685429 |
11 | 5867625a |
12 | 318a3585 |
13 | 1a46578c |
14 | 10d74193 |
15 | 9d5d41e |
hex | 6b77175 |
112685429 has 4 divisors (see below), whose sum is σ = 112714284. Its totient is φ = 112656576.
The previous prime is 112685423. The next prime is 112685459. The reversal of 112685429 is 924586211.
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 19562929 + 93122500 = 4423^2 + 9650^2 .
It is a cyclic number.
It is not a de Polignac number, because 112685429 - 212 = 112681333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112685392 and 112685401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112685423) 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 in 3 ways as a sum of consecutive naturals, for example, 7442 + ... + 16755.
It is an arithmetic number, because the mean of its divisors is an integer number (28178571).
Almost surely, 2112685429 is an apocalyptic number.
It is an amenable number.
112685429 is a deficient number, since it is larger than the sum of its proper divisors (28855).
112685429 is an equidigital number, since it uses as much as digits as its factorization.
112685429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28854.
The product of its digits is 34560, while the sum is 38.
The square root of 112685429 is about 10615.3393257116. The cubic root of 112685429 is about 483.0097759453.
The spelling of 112685429 in words is "one hundred twelve million, six hundred eighty-five thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •