Base | Representation |
---|---|
bin | 11001101110000000111111… |
… | …011101001001000011001111 |
3 | 112211111112020222121202000101 |
4 | 121232000333131021003033 |
5 | 104311222041231430221 |
6 | 1040323313211111531 |
7 | 32553111412156441 |
oct | 3156007735110317 |
9 | 484445228552011 |
10 | 113113323311311 |
11 | 33050100172a54 |
12 | 1082a1531425a7 |
13 | 4b16704982c4b |
14 | 1dd09dd544491 |
15 | d1250cba8d91 |
hex | 66e03f7490cf |
113113323311311 has 8 divisors (see below), whose sum is σ = 115499775798144. Its totient is φ = 110749491227520.
The previous prime is 113113323311297. The next prime is 113113323311323.
113113323311311 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113113323311311 - 237 = 112975884357839 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 113113323311311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113113323371311) 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, 5655090655 + ... + 5655110656.
It is an arithmetic number, because the mean of its divisors is an integer number (14437471974768).
Almost surely, 2113113323311311 is an apocalyptic number.
113113323311311 is a deficient number, since it is larger than the sum of its proper divisors (2386452486833).
113113323311311 is a wasteful number, since it uses less digits than its factorization.
113113323311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11310201521.
The product of its digits is 1458, while the sum is 28.
The spelling of 113113323311311 in words is "one hundred thirteen trillion, one hundred thirteen billion, three hundred twenty-three million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •