Base | Representation |
---|---|
bin | 110100010110101100… |
… | …0000001100000010001 |
3 | 101202012110200012121221 |
4 | 1220231120001200101 |
5 | 3320224142001113 |
6 | 123352210045041 |
7 | 11060062550656 |
oct | 1505530014021 |
9 | 352173605557 |
10 | 112430422033 |
11 | 43755051166 |
12 | 19958879781 |
13 | a7a9ba7957 |
14 | 5627cc1c2d |
15 | 2dd067c98d |
hex | 1a2d601811 |
112430422033 has 8 divisors (see below), whose sum is σ = 115052688000. Its totient is φ = 109817744880.
The previous prime is 112430422009. The next prime is 112430422043. The reversal of 112430422033 is 330224034211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112430422033 - 217 = 112430290961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112430421989 and 112430422007.
It is not an unprimeable number, because it can be changed into a prime (112430422003) 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 7 ways as a sum of consecutive naturals, for example, 2373478 + ... + 2420383.
It is an arithmetic number, because the mean of its divisors is an integer number (14381586000).
Almost surely, 2112430422033 is an apocalyptic number.
It is an amenable number.
112430422033 is a deficient number, since it is larger than the sum of its proper divisors (2622265967).
112430422033 is an equidigital number, since it uses as much as digits as its factorization.
112430422033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4794407.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 112430422033 its reverse (330224034211), we get a palindrome (442654456244).
The spelling of 112430422033 in words is "one hundred twelve billion, four hundred thirty million, four hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •