Base | Representation |
---|---|
bin | 11001101110000111100000… |
… | …100100110100001011000100 |
3 | 112211112012022200210121011220 |
4 | 121232013200210310023010 |
5 | 104311330404241001040 |
6 | 1040330431441000340 |
7 | 32553450006136533 |
oct | 3156074044641304 |
9 | 484465280717156 |
10 | 113120321422020 |
11 | 33053071447120 |
12 | 1082b5869230b0 |
13 | 4b1727b776c63 |
14 | 1dd10a4b2c31a |
15 | d127bc24d2d0 |
hex | 66e1e09342c4 |
113120321422020 has 96 divisors (see below), whose sum is σ = 345582148101120. Its totient is φ = 27419061836160.
The previous prime is 113120321422019. The next prime is 113120321422067. The reversal of 113120321422020 is 20224123021311.
It is a super-2 number, since 2×1131203214220202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8167432 + ... + 17115711.
It is an arithmetic number, because the mean of its divisors is an integer number (3599814042720).
Almost surely, 2113120321422020 is an apocalyptic number.
113120321422020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113120321422020 is an abundant number, since it is smaller than the sum of its proper divisors (232461826679100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113120321422020 is a wasteful number, since it uses less digits than its factorization.
113120321422020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25289945 (or 25289943 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 113120321422020 its reverse (20224123021311), we get a palindrome (133344444443331).
The spelling of 113120321422020 in words is "one hundred thirteen trillion, one hundred twenty billion, three hundred twenty-one million, four hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •