Base | Representation |
---|---|
bin | 11001101110010000101111… |
… | …110110001100010100101011 |
3 | 112211120010221000211020002002 |
4 | 121232100233312030110223 |
5 | 104312011213233441133 |
6 | 1040335152042401215 |
7 | 32554250561616644 |
oct | 3156205766142453 |
9 | 484503830736062 |
10 | 113130241312043 |
11 | 330572a1a1533a |
12 | 10831494b0020b |
13 | 4b1819c995c77 |
14 | 1dd176639a6cb |
15 | d12b9d084ce8 |
hex | 66e42fd8c52b |
113130241312043 has 6 divisors (see below), whose sum is σ = 120176415511716. Its totient is φ = 106475521234592.
The previous prime is 113130241312013. The next prime is 113130241312087. The reversal of 113130241312043 is 340213142031311.
It is not a de Polignac number, because 113130241312043 - 236 = 113061521835307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113130241311997 and 113130241312015.
It is not an unprimeable number, because it can be changed into a prime (113130241312003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 195727060805 + ... + 195727061382.
It is an arithmetic number, because the mean of its divisors is an integer number (20029402585286).
Almost surely, 2113130241312043 is an apocalyptic number.
113130241312043 is a deficient number, since it is larger than the sum of its proper divisors (7046174199673).
113130241312043 is an equidigital number, since it uses as much as digits as its factorization.
113130241312043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391454122221 (or 391454122204 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 113130241312043 its reverse (340213142031311), we get a palindrome (453343383343354).
The spelling of 113130241312043 in words is "one hundred thirteen trillion, one hundred thirty billion, two hundred forty-one million, three hundred twelve thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •