Base | Representation |
---|---|
bin | 110100010011110000… |
… | …1011101000101110111 |
3 | 101201221121220120220011 |
4 | 1220213201131011313 |
5 | 3320024022343111 |
6 | 123334341321051 |
7 | 11054461131556 |
oct | 1504741350567 |
9 | 351847816804 |
10 | 112332231031 |
11 | 43704685879 |
12 | 1992ba06187 |
13 | a792748677 |
14 | 5618c41d9d |
15 | 2dc6c34021 |
hex | 1a2785d177 |
112332231031 has 8 divisors (see below), whose sum is σ = 112635961344. Its totient is φ = 112028605920.
The previous prime is 112332231023. The next prime is 112332231047. The reversal of 112332231031 is 130132233211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112332231031 - 23 = 112332231023 is a prime.
It is a super-2 number, since 2×1123322310312 (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 = 112332230993 and 112332231011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112332231071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2415741 + ... + 2461801.
It is an arithmetic number, because the mean of its divisors is an integer number (14079495168).
Almost surely, 2112332231031 is an apocalyptic number.
112332231031 is a deficient number, since it is larger than the sum of its proper divisors (303730313).
112332231031 is an equidigital number, since it uses as much as digits as its factorization.
112332231031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52601.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 112332231031 its reverse (130132233211), we get a palindrome (242464464242).
The spelling of 112332231031 in words is "one hundred twelve billion, three hundred thirty-two million, two hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •