Base | Representation |
---|---|
bin | 110100001101110001… |
… | …1011101101001101111 |
3 | 101201102122001220001211 |
4 | 1220123203131221233 |
5 | 3314121121243043 |
6 | 123302405415251 |
7 | 11046502303033 |
oct | 1503343355157 |
9 | 351378056054 |
10 | 112131431023 |
11 | 436112a6857 |
12 | 1989470a527 |
13 | a75cc711b1 |
14 | 55da2d21c3 |
15 | 2db42bca9d |
hex | 1a1b8dda6f |
112131431023 has 4 divisors (see below), whose sum is σ = 112190793120. Its totient is φ = 112072068928.
The previous prime is 112131431017. The next prime is 112131431033. The reversal of 112131431023 is 320134131211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320134131211 = 17 ⋅18831419483.
It is a cyclic number.
It is not a de Polignac number, because 112131431023 - 213 = 112131422831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112131430985 and 112131431003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112131431033) 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, 29678215 + ... + 29681992.
It is an arithmetic number, because the mean of its divisors is an integer number (28047698280).
Almost surely, 2112131431023 is an apocalyptic number.
112131431023 is a deficient number, since it is larger than the sum of its proper divisors (59362097).
112131431023 is an equidigital number, since it uses as much as digits as its factorization.
112131431023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59362096.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112131431023 its reverse (320134131211), we get a palindrome (432265562234).
The spelling of 112131431023 in words is "one hundred twelve billion, one hundred thirty-one million, four hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •