Base | Representation |
---|---|
bin | 11001101100010111110101… |
… | …111110010100010000110111 |
3 | 112211002201211122122120022001 |
4 | 121230113311332110100313 |
5 | 104302344330331004221 |
6 | 1040155402114120131 |
7 | 32542003532244004 |
oct | 3154276576242067 |
9 | 484081748576261 |
10 | 113000421344311 |
11 | 33007233a30106 |
12 | 108102a4580047 |
13 | 4b08b811a6c07 |
14 | 1dc936cb968ab |
15 | d0e600e34391 |
hex | 66c5f5f94437 |
113000421344311 has 16 divisors (see below), whose sum is σ = 119206620000000. Its totient is φ = 106820177080896.
The previous prime is 113000421344219. The next prime is 113000421344341. The reversal of 113000421344311 is 113443124000311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113000421344311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113000421344311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113000421344341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54435510 + ... + 56473228.
It is an arithmetic number, because the mean of its divisors is an integer number (7450413750000).
Almost surely, 2113000421344311 is an apocalyptic number.
113000421344311 is a deficient number, since it is larger than the sum of its proper divisors (6206198655689).
113000421344311 is a wasteful number, since it uses less digits than its factorization.
113000421344311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2044086.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 113000421344311 its reverse (113443124000311), we get a palindrome (226443545344622).
The spelling of 113000421344311 in words is "one hundred thirteen trillion, four hundred twenty-one million, three hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •