Base | Representation |
---|---|
bin | 110100010110001010… |
… | …1101001001111010101 |
3 | 101202011020221011002110 |
4 | 1220230111221033111 |
5 | 3320210213134031 |
6 | 123350345101233 |
7 | 11056461625341 |
oct | 1505425511725 |
9 | 352136834073 |
10 | 112413021141 |
11 | 43746246663 |
12 | 19952a87819 |
13 | a7a63c4575 |
14 | 5625872621 |
15 | 2dcdd91c46 |
hex | 1a2c5693d5 |
112413021141 has 4 divisors (see below), whose sum is σ = 149884028192. Its totient is φ = 74942014092.
The previous prime is 112413021113. The next prime is 112413021179. The reversal of 112413021141 is 141120314211.
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.
It is not a de Polignac number, because 112413021141 - 235 = 78053282773 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112413021241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18735503521 + ... + 18735503526.
It is an arithmetic number, because the mean of its divisors is an integer number (37471007048).
Almost surely, 2112413021141 is an apocalyptic number.
It is an amenable number.
112413021141 is a deficient number, since it is larger than the sum of its proper divisors (37471007051).
112413021141 is an equidigital number, since it uses as much as digits as its factorization.
112413021141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37471007050.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 112413021141 its reverse (141120314211), we get a palindrome (253533335352).
The spelling of 112413021141 in words is "one hundred twelve billion, four hundred thirteen million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •