Base | Representation |
---|---|
bin | 1101011100110… |
… | …01011100011001 |
3 | 21212022011100211 |
4 | 12232121130121 |
5 | 212340414022 |
6 | 15110131121 |
7 | 2540002114 |
oct | 656313431 |
9 | 255264324 |
10 | 112826137 |
11 | 58761a46 |
12 | 31950aa1 |
13 | 1a4b4838 |
14 | 10dad57b |
15 | 9d89e77 |
hex | 6b99719 |
112826137 has 4 divisors (see below), whose sum is σ = 115578036. Its totient is φ = 110074240.
The previous prime is 112826117. The next prime is 112826167. The reversal of 112826137 is 731628211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 731628211 = 29 ⋅25228559.
It can be written as a sum of positive squares in 2 ways, for example, as 51423241 + 61402896 = 7171^2 + 7836^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112826137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112826099 and 112826108.
It is not an unprimeable number, because it can be changed into a prime (112826117) 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, 1375888 + ... + 1375969.
It is an arithmetic number, because the mean of its divisors is an integer number (28894509).
Almost surely, 2112826137 is an apocalyptic number.
It is an amenable number.
112826137 is a deficient number, since it is larger than the sum of its proper divisors (2751899).
112826137 is an equidigital number, since it uses as much as digits as its factorization.
112826137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2751898.
The product of its digits is 4032, while the sum is 31.
The square root of 112826137 is about 10621.9648370723. The cubic root of 112826137 is about 483.2107338142.
The spelling of 112826137 in words is "one hundred twelve million, eight hundred twenty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •