Base | Representation |
---|---|
bin | 110100010110001011… |
… | …1101011110110101101 |
3 | 101202011021221022222021 |
4 | 1220230113223312231 |
5 | 3320210332244031 |
6 | 123350404350141 |
7 | 11056466314165 |
oct | 1505427536655 |
9 | 352137838867 |
10 | 112413556141 |
11 | 43746581607 |
12 | 199530a5351 |
13 | a7a6550c33 |
14 | 56259715a5 |
15 | 2dcde4a511 |
hex | 1a2c5ebdad |
112413556141 has 4 divisors (see below), whose sum is σ = 112491676800. Its totient is φ = 112335435484.
The previous prime is 112413556139. The next prime is 112413556201. The reversal of 112413556141 is 141655314211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141655314211 = 59 ⋅2400937529.
It is a cyclic number.
It is not a de Polignac number, because 112413556141 - 21 = 112413556139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112413556097 and 112413556106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112413556441) 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, 39058171 + ... + 39061048.
It is an arithmetic number, because the mean of its divisors is an integer number (28122919200).
Almost surely, 2112413556141 is an apocalyptic number.
It is an amenable number.
112413556141 is a deficient number, since it is larger than the sum of its proper divisors (78120659).
112413556141 is an equidigital number, since it uses as much as digits as its factorization.
112413556141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78120658.
The product of its digits is 14400, while the sum is 34.
The spelling of 112413556141 in words is "one hundred twelve billion, four hundred thirteen million, five hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.549 sec. • engine limits •