Base | Representation |
---|---|
bin | 110100010111000100… |
… | …1010000111110000000 |
3 | 101202020100222000121210 |
4 | 1220232021100332000 |
5 | 3320240443033212 |
6 | 123353350450120 |
7 | 11060310352536 |
oct | 1505611207600 |
9 | 352210860553 |
10 | 112443330432 |
11 | 43761368464 |
12 | 19961063940 |
13 | a7ac777264 |
14 | 56298c2156 |
15 | 2dd187c53c |
hex | 1a2e250f80 |
112443330432 has 32 divisors (see below), whose sum is σ = 298677597480. Its totient is φ = 37481110016.
The previous prime is 112443330431. The next prime is 112443330451. The reversal of 112443330432 is 234033344211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 112443330432.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112443330431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146410203 + ... + 146410970.
Almost surely, 2112443330432 is an apocalyptic number.
112443330432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112443330432 is an abundant number, since it is smaller than the sum of its proper divisors (186234267048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112443330432 is an equidigital number, since it uses as much as digits as its factorization.
112443330432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292821190 (or 292821178 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 112443330432 its reverse (234033344211), we get a palindrome (346476674643).
The spelling of 112443330432 in words is "one hundred twelve billion, four hundred forty-three million, three hundred thirty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •