Base | Representation |
---|---|
bin | 11001100011101001100111… |
… | …100011001011010110101001 |
3 | 112201222102201010202010010120 |
4 | 121203221213203023112221 |
5 | 104213034303020123423 |
6 | 1035020153155433453 |
7 | 32450464225003254 |
oct | 3143514743132651 |
9 | 481872633663116 |
10 | 112401031411113 |
11 | 328a6011a40855 |
12 | 107340a5bb5889 |
13 | 4a944aaa5b3a3 |
14 | 1da834b95a09b |
15 | cedc1e921ee3 |
hex | 663a678cb5a9 |
112401031411113 has 8 divisors (see below), whose sum is σ = 152408178184800. Its totient is φ = 73663952789088.
The previous prime is 112401031411079. The next prime is 112401031411181. The reversal of 112401031411113 is 311114130104211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112401031411113 - 210 = 112401031410089 is a prime.
It is a super-2 number, since 2×1124010314111132 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112401031411183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317517037708 + ... + 317517038061.
It is an arithmetic number, because the mean of its divisors is an integer number (19051022273100).
Almost surely, 2112401031411113 is an apocalyptic number.
It is an amenable number.
112401031411113 is a deficient number, since it is larger than the sum of its proper divisors (40007146773687).
112401031411113 is an equidigital number, since it uses as much as digits as its factorization.
112401031411113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635034075831.
The product of its (nonzero) digits is 288, while the sum is 24.
Adding to 112401031411113 its reverse (311114130104211), we get a palindrome (423515161515324).
The spelling of 112401031411113 in words is "one hundred twelve trillion, four hundred one billion, thirty-one million, four hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •