Base | Representation |
---|---|
bin | 1101011010010… |
… | …11100011111011 |
3 | 21211200221202210 |
4 | 12231023203323 |
5 | 212300212011 |
6 | 15055230203 |
7 | 2534203062 |
oct | 655134373 |
9 | 254627683 |
10 | 112507131 |
11 | 58564300 |
12 | 31818363 |
13 | 1a402589 |
14 | 10d291d9 |
15 | 9d256a6 |
hex | 6b4b8fb |
112507131 has 12 divisors (see below), whose sum is σ = 164887016. Its totient is φ = 68185920.
The previous prime is 112507093. The next prime is 112507133. The reversal of 112507131 is 131705211.
It is a happy number.
It is not a de Polignac number, because 112507131 - 211 = 112505083 is a prime.
It is a super-2 number, since 2×1125071312 = 25315709051702322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112507098 and 112507107.
It is not an unprimeable number, because it can be changed into a prime (112507133) 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 11 ways as a sum of consecutive naturals, for example, 154606 + ... + 155331.
Almost surely, 2112507131 is an apocalyptic number.
112507131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112507131 is a deficient number, since it is larger than the sum of its proper divisors (52379885).
112507131 is a wasteful number, since it uses less digits than its factorization.
112507131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309962 (or 309951 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 21.
The square root of 112507131 is about 10606.9378710352. The cubic root of 112507131 is about 482.7548919463.
It can be divided in two parts, 11250 and 7131, that added together give a palindrome (18381).
The spelling of 112507131 in words is "one hundred twelve million, five hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •