Base | Representation |
---|---|
bin | 1101011001111… |
… | …00011111100101 |
3 | 21211120211002221 |
4 | 12230330133211 |
5 | 212241223123 |
6 | 15054032341 |
7 | 2533525123 |
oct | 654743745 |
9 | 254524087 |
10 | 112445413 |
11 | 585219a3 |
12 | 317a86b1 |
13 | 1a3b0462 |
14 | 10d10913 |
15 | 9d1225d |
hex | 6b3c7e5 |
112445413 has 4 divisors (see below), whose sum is σ = 117334368. Its totient is φ = 107556460.
The previous prime is 112445393. The next prime is 112445449. The reversal of 112445413 is 314544211.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112445413 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 (112442413) 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, 2444443 + ... + 2444488.
It is an arithmetic number, because the mean of its divisors is an integer number (29333592).
Almost surely, 2112445413 is an apocalyptic number.
It is an amenable number.
112445413 is a deficient number, since it is larger than the sum of its proper divisors (4888955).
112445413 is an equidigital number, since it uses as much as digits as its factorization.
112445413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4888954.
The product of its digits is 1920, while the sum is 25.
The square root of 112445413 is about 10604.0281497174. The cubic root of 112445413 is about 482.6666009021. Note that the first 4 decimals are identical.
Adding to 112445413 its reverse (314544211), we get a palindrome (426989624).
The spelling of 112445413 in words is "one hundred twelve million, four hundred forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •