Base | Representation |
---|---|
bin | 11001101111101110110111… |
… | …100011000000010100010001 |
3 | 112211220210210010202211222002 |
4 | 121233232313203000110101 |
5 | 104320140201332400223 |
6 | 1040453424144523345 |
7 | 32564456140352360 |
oct | 3157566743002421 |
9 | 484823703684862 |
10 | 113231302231313 |
11 | 330961421a2822 |
12 | 10848b9a020555 |
13 | 4b24887222096 |
14 | 1dd65d22a57d7 |
15 | d156154d5e28 |
hex | 66fbb78c0511 |
113231302231313 has 16 divisors (see below), whose sum is σ = 134763766772736. Its totient is φ = 93093391480320.
The previous prime is 113231302231297. The next prime is 113231302231349. The reversal of 113231302231313 is 313132203132311.
113231302231313 is digitally balanced in base 8, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 113231302231313 - 24 = 113231302231297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113231302231373) 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, 2308839356 + ... + 2308888397.
It is an arithmetic number, because the mean of its divisors is an integer number (8422735423296).
Almost surely, 2113231302231313 is an apocalyptic number.
It is an amenable number.
113231302231313 is a deficient number, since it is larger than the sum of its proper divisors (21532464541423).
113231302231313 is a wasteful number, since it uses less digits than its factorization.
113231302231313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4617727904.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 113231302231313 its reverse (313132203132311), we get a palindrome (426363505363624).
The spelling of 113231302231313 in words is "one hundred thirteen trillion, two hundred thirty-one billion, three hundred two million, two hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •