Base | Representation |
---|---|
bin | 110100001110010101… |
… | …1101000110010110111 |
3 | 101201110221200010102212 |
4 | 1220130223220302313 |
5 | 3314140442213111 |
6 | 123304323124035 |
7 | 11050122153305 |
oct | 1503453506267 |
9 | 351427603385 |
10 | 112150351031 |
11 | 43620a49724 |
12 | 1989ab1361b |
13 | a763b66b74 |
14 | 55dca19275 |
15 | 2db5ca898b |
hex | 1a1cae8cb7 |
112150351031 has 4 divisors (see below), whose sum is σ = 112174510392. Its totient is φ = 112126191672.
The previous prime is 112150351021. The next prime is 112150351043. The reversal of 112150351031 is 130153051211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130153051211 = 181 ⋅719077631.
It is a cyclic number.
It is not a de Polignac number, because 112150351031 - 218 = 112150088887 is a prime.
It is a super-2 number, since 2×1121503510312 (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 = 112150350988 and 112150351006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112150351021) 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, 12072716 + ... + 12082001.
It is an arithmetic number, because the mean of its divisors is an integer number (28043627598).
Almost surely, 2112150351031 is an apocalyptic number.
112150351031 is a deficient number, since it is larger than the sum of its proper divisors (24159361).
112150351031 is an equidigital number, since it uses as much as digits as its factorization.
112150351031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24159360.
The product of its (nonzero) digits is 450, while the sum is 23.
The spelling of 112150351031 in words is "one hundred twelve billion, one hundred fifty million, three hundred fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •