Base | Representation |
---|---|
bin | 1101010111011… |
… | …11100110001011 |
3 | 21210222211001101 |
4 | 12223233212023 |
5 | 212201133233 |
6 | 15043202231 |
7 | 2531043625 |
oct | 653574613 |
9 | 253884041 |
10 | 112130443 |
11 | 58327297 |
12 | 31676377 |
13 | 1a2ccc99 |
14 | 10c6bc15 |
15 | 9c9dc7d |
hex | 6aef98b |
112130443 has 8 divisors (see below), whose sum is σ = 116124480. Its totient is φ = 108144960.
The previous prime is 112130437. The next prime is 112130479. The reversal of 112130443 is 344031211.
112130443 = 10922 + 10932 + ... + 11782.
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 112130443 - 29 = 112129931 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112130443.
It is not an unprimeable number, because it can be changed into a prime (112130423) 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 7 ways as a sum of consecutive naturals, for example, 36846 + ... + 39772.
It is an arithmetic number, because the mean of its divisors is an integer number (14515560).
Almost surely, 2112130443 is an apocalyptic number.
112130443 is a deficient number, since it is larger than the sum of its proper divisors (3994037).
112130443 is a wasteful number, since it uses less digits than its factorization.
112130443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4277.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 112130443 is about 10589.1663033499. The cubic root of 112130443 is about 482.2155148673.
Adding to 112130443 its reverse (344031211), we get a palindrome (456161654).
The spelling of 112130443 in words is "one hundred twelve million, one hundred thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •