Base | Representation |
---|---|
bin | 11001101100100010110101… |
… | …001111111000000000011100 |
3 | 112211010212021221112010212110 |
4 | 121230202311033320000130 |
5 | 104303043011401030022 |
6 | 1040205033003234020 |
7 | 32542602113050143 |
oct | 3154426517700034 |
9 | 484125257463773 |
10 | 113012220330012 |
11 | 33011239176763 |
12 | 10812637b18910 |
13 | 4b0a0117ba863 |
14 | 1dc9b6bc0a75a |
15 | d0ea91bea00c |
hex | 66c8b53f801c |
113012220330012 has 24 divisors (see below), whose sum is σ = 272788118038800. Its totient is φ = 36371749071616.
The previous prime is 113012220329999. The next prime is 113012220330013. The reversal of 113012220330012 is 210033022210311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113012220330013) 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, 162373879437 + ... + 162373880132.
It is an arithmetic number, because the mean of its divisors is an integer number (11366171584950).
Almost surely, 2113012220330012 is an apocalyptic number.
113012220330012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113012220330012 is an abundant number, since it is smaller than the sum of its proper divisors (159775897708788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113012220330012 is a wasteful number, since it uses less digits than its factorization.
113012220330012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324747759605 (or 324747759603 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113012220330012 its reverse (210033022210311), we get a palindrome (323045242540323).
The spelling of 113012220330012 in words is "one hundred thirteen trillion, twelve billion, two hundred twenty million, three hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •