Base | Representation |
---|---|
bin | 1101011000110… |
… | …11101011101110 |
3 | 21211022222202111 |
4 | 12230123223232 |
5 | 212222423042 |
6 | 15051114234 |
7 | 2532425245 |
oct | 654335356 |
9 | 254288674 |
10 | 112311022 |
11 | 5843aa2a |
12 | 3174297a |
13 | 1a364235 |
14 | 10cb795c |
15 | 9cd7517 |
hex | 6b1baee |
112311022 has 4 divisors (see below), whose sum is σ = 168466536. Its totient is φ = 56155510.
The previous prime is 112310987. The next prime is 112311029. The reversal of 112311022 is 220113211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 220113211 = 1109 ⋅198479.
It is a super-2 number, since 2×1123110222 = 25227531325368968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112310993 and 112311011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112311029) 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 as a sum of consecutive naturals, namely, 28077754 + ... + 28077757.
It is an arithmetic number, because the mean of its divisors is an integer number (42116634).
Almost surely, 2112311022 is an apocalyptic number.
112311022 is a deficient number, since it is larger than the sum of its proper divisors (56155514).
112311022 is an equidigital number, since it uses as much as digits as its factorization.
112311022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56155513.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 112311022 is about 10597.6894651617. The cubic root of 112311022 is about 482.4742352480.
Adding to 112311022 its reverse (220113211), we get a palindrome (332424233).
The spelling of 112311022 in words is "one hundred twelve million, three hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •