Base | Representation |
---|---|
bin | 110100001101101111… |
… | …0000001010010010001 |
3 | 101201102112101101201022 |
4 | 1220123132001102101 |
5 | 3314120240112423 |
6 | 123302315045225 |
7 | 11046454210661 |
oct | 1503336012221 |
9 | 351375341638 |
10 | 112130004113 |
11 | 43610511796 |
12 | 19894140815 |
13 | a75c89187a |
14 | 55da0401a1 |
15 | 2db40d9dc8 |
hex | 1a1b781491 |
112130004113 has 4 divisors (see below), whose sum is σ = 112137994980. Its totient is φ = 112122013248.
The previous prime is 112130004053. The next prime is 112130004137. The reversal of 112130004113 is 311400031211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30141126544 + 81988877569 = 173612^2 + 286337^2 .
It is a cyclic number.
It is not a de Polignac number, because 112130004113 - 220 = 112128955537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112130004091 and 112130004100.
It is not an unprimeable number, because it can be changed into a prime (112130004193) 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, 3974348 + ... + 4002461.
It is an arithmetic number, because the mean of its divisors is an integer number (28034498745).
Almost surely, 2112130004113 is an apocalyptic number.
It is an amenable number.
112130004113 is a deficient number, since it is larger than the sum of its proper divisors (7990867).
112130004113 is an equidigital number, since it uses as much as digits as its factorization.
112130004113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7990866.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112130004113 its reverse (311400031211), we get a palindrome (423530035324).
The spelling of 112130004113 in words is "one hundred twelve billion, one hundred thirty million, four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •