Base | Representation |
---|---|
bin | 110100011001101010… |
… | …0000000100111110101 |
3 | 101202110102002222101020 |
4 | 1220303110000213311 |
5 | 3320430142030031 |
6 | 123410125051353 |
7 | 11062412333241 |
oct | 1506324004765 |
9 | 352412088336 |
10 | 112530033141 |
11 | 437a62a7499 |
12 | 199860b6b59 |
13 | a7c4713436 |
14 | 5637211421 |
15 | 2dd92a7096 |
hex | 1a335009f5 |
112530033141 has 4 divisors (see below), whose sum is σ = 150040044192. Its totient is φ = 75020022092.
The previous prime is 112530033097. The next prime is 112530033179. The reversal of 112530033141 is 141330035211.
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 a cyclic number.
It is not a de Polignac number, because 112530033141 - 222 = 112525838837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112530033041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18755005521 + ... + 18755005526.
It is an arithmetic number, because the mean of its divisors is an integer number (37510011048).
Almost surely, 2112530033141 is an apocalyptic number.
It is an amenable number.
112530033141 is a deficient number, since it is larger than the sum of its proper divisors (37510011051).
112530033141 is an equidigital number, since it uses as much as digits as its factorization.
112530033141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37510011050.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 112530033141 its reverse (141330035211), we get a palindrome (253860068352).
The spelling of 112530033141 in words is "one hundred twelve billion, five hundred thirty million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •