Base | Representation |
---|---|
bin | 1101010110110… |
… | …10000111000001 |
3 | 21210211100022202 |
4 | 12223122013001 |
5 | 212140324213 |
6 | 15041242545 |
7 | 2530226216 |
oct | 653320701 |
9 | 253740282 |
10 | 112042433 |
11 | 58277158 |
12 | 31633455 |
13 | 1a29bbc9 |
14 | 10c47b0d |
15 | 9c82b58 |
hex | 6ada1c1 |
112042433 has 4 divisors (see below), whose sum is σ = 112536240. Its totient is φ = 111548628.
The previous prime is 112042429. The next prime is 112042459. The reversal of 112042433 is 334240211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 334240211 = 181 ⋅1846631.
It is a cyclic number.
It is not a de Polignac number, because 112042433 - 22 = 112042429 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112042493) 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, 246563 + ... + 247016.
It is an arithmetic number, because the mean of its divisors is an integer number (28134060).
Almost surely, 2112042433 is an apocalyptic number.
It is an amenable number.
112042433 is a deficient number, since it is larger than the sum of its proper divisors (493807).
112042433 is an equidigital number, since it uses as much as digits as its factorization.
112042433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493806.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 112042433 is about 10585.0098252198. The cubic root of 112042433 is about 482.0893198910.
Adding to 112042433 its reverse (334240211), we get a palindrome (446282644).
The spelling of 112042433 in words is "one hundred twelve million, forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •