Base | Representation |
---|---|
bin | 1101011001110… |
… | …01001111011101 |
3 | 21211120010211121 |
4 | 12230321033131 |
5 | 212240311333 |
6 | 15053450541 |
7 | 2533441234 |
oct | 654711735 |
9 | 254503747 |
10 | 112432093 |
11 | 58512994 |
12 | 317a0a51 |
13 | 1a3a7387 |
14 | 10d09b1b |
15 | 9d0d32d |
hex | 6b393dd |
112432093 has 4 divisors (see below), whose sum is σ = 112503580. Its totient is φ = 112360608.
The previous prime is 112432091. The next prime is 112432109. The reversal of 112432093 is 390234211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 390234211 = 83 ⋅4701617.
It can be written as a sum of positive squares in 2 ways, for example, as 55323844 + 57108249 = 7438^2 + 7557^2 .
It is a cyclic number.
It is not a de Polignac number, because 112432093 - 21 = 112432091 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 (112432091) 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, 33330 + ... + 36547.
It is an arithmetic number, because the mean of its divisors is an integer number (28125895).
Almost surely, 2112432093 is an apocalyptic number.
It is an amenable number.
112432093 is a deficient number, since it is larger than the sum of its proper divisors (71487).
112432093 is an equidigital number, since it uses as much as digits as its factorization.
112432093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71486.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 112432093 is about 10603.4000679027. The cubic root of 112432093 is about 482.6475416601.
The spelling of 112432093 in words is "one hundred twelve million, four hundred thirty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •