Base | Representation |
---|---|
bin | 11001110001010101111110… |
… | …110111010110011111011101 |
3 | 112212022101120021120020221220 |
4 | 121301111332313112133131 |
5 | 104323443424211212110 |
6 | 1041020334431443553 |
7 | 32605455632362230 |
oct | 3161257667263735 |
9 | 485271507506856 |
10 | 113342020413405 |
11 | 33129098780753 |
12 | 108665393865b9 |
13 | 4b321504561b4 |
14 | 1ddbad69d7417 |
15 | d18445693370 |
hex | 67157edd67dd |
113342020413405 has 32 divisors (see below), whose sum is σ = 207257092057344. Its totient is φ = 51812717078016.
The previous prime is 113342020413371. The next prime is 113342020413539. The reversal of 113342020413405 is 504314020243311.
It is not a de Polignac number, because 113342020413405 - 29 = 113342020412893 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1048312 + ... + 15092481.
It is an arithmetic number, because the mean of its divisors is an integer number (6476784126792).
Almost surely, 2113342020413405 is an apocalyptic number.
113342020413405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
113342020413405 is a deficient number, since it is larger than the sum of its proper divisors (93915071643939).
113342020413405 is a wasteful number, since it uses less digits than its factorization.
113342020413405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16207685.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 113342020413405 its reverse (504314020243311), we get a palindrome (617656040656716).
The spelling of 113342020413405 in words is "one hundred thirteen trillion, three hundred forty-two billion, twenty million, four hundred thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •