Base | Representation |
---|---|
bin | 1101011000010… |
… | …00001011011011 |
3 | 21211011221011120 |
4 | 12230020023123 |
5 | 212212344011 |
6 | 15045300323 |
7 | 2531643315 |
oct | 654101333 |
9 | 254157146 |
10 | 112231131 |
11 | 58395a01 |
12 | 317046a3 |
13 | 1a336a6c |
14 | 10c967b5 |
15 | 9cbda06 |
hex | 6b082db |
112231131 has 8 divisors (see below), whose sum is σ = 154801680. Its totient is φ = 72240672.
The previous prime is 112231117. The next prime is 112231139. The reversal of 112231131 is 131132211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112231131 - 219 = 111706843 is a prime.
It is a super-2 number, since 2×1122311312 = 25191653531078322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112231131.
It is not an unprimeable number, because it can be changed into a prime (112231139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 644920 + ... + 645093.
It is an arithmetic number, because the mean of its divisors is an integer number (19350210).
Almost surely, 2112231131 is an apocalyptic number.
112231131 is a deficient number, since it is larger than the sum of its proper divisors (42570549).
112231131 is a wasteful number, since it uses less digits than its factorization.
112231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290045.
The product of its digits is 36, while the sum is 15.
The square root of 112231131 is about 10593.9195296170. The cubic root of 112231131 is about 482.3598074990.
Adding to 112231131 its reverse (131132211), we get a palindrome (243363342).
The spelling of 112231131 in words is "one hundred twelve million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •