Base | Representation |
---|---|
bin | 110100010110101111… |
… | …0111101100111101011 |
3 | 101202012121002121221221 |
4 | 1220231132331213223 |
5 | 3320230123204011 |
6 | 123352313042511 |
7 | 11060114165320 |
oct | 1505536754753 |
9 | 352177077857 |
10 | 112432241131 |
11 | 43756083951 |
12 | 199593b6437 |
13 | a7aa393942 |
14 | 5628236b47 |
15 | 2dd08db971 |
hex | 1a2d7bd9eb |
112432241131 has 8 divisors (see below), whose sum is σ = 136052460000. Its totient is φ = 90701639808.
The previous prime is 112432241081. The next prime is 112432241167. The reversal of 112432241131 is 131142234211.
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 112432241131 - 215 = 112432208363 is a prime.
It is a super-2 number, since 2×1124322411312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112432241096 and 112432241105.
It is not an unprimeable number, because it can be changed into a prime (112432241731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 472404256 + ... + 472404493.
It is an arithmetic number, because the mean of its divisors is an integer number (17006557500).
Almost surely, 2112432241131 is an apocalyptic number.
112432241131 is a deficient number, since it is larger than the sum of its proper divisors (23620218869).
112432241131 is an equidigital number, since it uses as much as digits as its factorization.
112432241131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 944808773.
The product of its digits is 1152, while the sum is 25.
Adding to 112432241131 its reverse (131142234211), we get a palindrome (243574475342).
The spelling of 112432241131 in words is "one hundred twelve billion, four hundred thirty-two million, two hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •