Base | Representation |
---|---|
bin | 110100010110101100… |
… | …0000110111001100011 |
3 | 101202012110201022221101 |
4 | 1220231120012321203 |
5 | 3320224143203011 |
6 | 123352210335231 |
7 | 11060063002255 |
oct | 1505530067143 |
9 | 352173638841 |
10 | 112430444131 |
11 | 43755066825 |
12 | 1995888a517 |
13 | a7a9bb4a25 |
14 | 5627cc9cd5 |
15 | 2dd06842c1 |
hex | 1a2d606e63 |
112430444131 has 4 divisors (see below), whose sum is σ = 112651329600. Its totient is φ = 112209558664.
The previous prime is 112430444081. The next prime is 112430444167. The reversal of 112430444131 is 131444034211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112430444131 - 27 = 112430444003 is a prime.
It is a super-2 number, since 2×1124304441312 (a number of 23 digits) contains 22 as substring.
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 112430444131.
It is not an unprimeable number, because it can be changed into a prime (112430444171) 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, 110441971 + ... + 110442988.
It is an arithmetic number, because the mean of its divisors is an integer number (28162832400).
Almost surely, 2112430444131 is an apocalyptic number.
112430444131 is a deficient number, since it is larger than the sum of its proper divisors (220885469).
112430444131 is an equidigital number, since it uses as much as digits as its factorization.
112430444131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220885468.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 112430444131 its reverse (131444034211), we get a palindrome (243874478342).
The spelling of 112430444131 in words is "one hundred twelve billion, four hundred thirty million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •