Base | Representation |
---|---|
bin | 1101010110100… |
… | …00100101100101 |
3 | 21210202100211011 |
4 | 12223100211211 |
5 | 212133102204 |
6 | 15040342221 |
7 | 2530004416 |
oct | 653204545 |
9 | 253670734 |
10 | 112003429 |
11 | 5824a91a |
12 | 31614971 |
13 | 1a287225 |
14 | 10c3780d |
15 | 9c76304 |
hex | 6ad0965 |
112003429 has 4 divisors (see below), whose sum is σ = 118591884. Its totient is φ = 105414976.
The previous prime is 112003421. The next prime is 112003439. The reversal of 112003429 is 924300211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 924300211 = 181 ⋅5106631.
It can be written as a sum of positive squares in 2 ways, for example, as 94614529 + 17388900 = 9727^2 + 4170^2 .
It is a cyclic number.
It is not a de Polignac number, because 112003429 - 23 = 112003421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112003421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3294202 + ... + 3294235.
It is an arithmetic number, because the mean of its divisors is an integer number (29647971).
Almost surely, 2112003429 is an apocalyptic number.
It is an amenable number.
112003429 is a deficient number, since it is larger than the sum of its proper divisors (6588455).
112003429 is an equidigital number, since it uses as much as digits as its factorization.
112003429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6588454.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 112003429 is about 10583.1672480406. The cubic root of 112003429 is about 482.0333720574.
The spelling of 112003429 in words is "one hundred twelve million, three thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •