Base | Representation |
---|---|
bin | 11001110000111001010010… |
… | …011011101110011111110000 |
3 | 112212012110001001201102000110 |
4 | 121300321102123232133300 |
5 | 104322442324302444440 |
6 | 1040554241254021320 |
7 | 32603315264043246 |
oct | 3160712233563760 |
9 | 485173031642013 |
10 | 113311210203120 |
11 | 33117018162746 |
12 | 1086057b047840 |
13 | 4b2c280274a37 |
14 | 1dda412b26796 |
15 | d17740877080 |
hex | 670e526ee7f0 |
113311210203120 has 40 divisors (see below), whose sum is σ = 351264751630416. Its totient is φ = 30216322720768.
The previous prime is 113311210203109. The next prime is 113311210203127. The reversal of 113311210203120 is 21302012113311.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113311210203127) 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, 236065021017 + ... + 236065021496.
Almost surely, 2113311210203120 is an apocalyptic number.
113311210203120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113311210203120 is an abundant number, since it is smaller than the sum of its proper divisors (237953541427296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113311210203120 is a wasteful number, since it uses less digits than its factorization.
113311210203120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472130042529 (or 472130042523 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 113311210203120 its reverse (21302012113311), we get a palindrome (134613222316431).
The spelling of 113311210203120 in words is "one hundred thirteen trillion, three hundred eleven billion, two hundred ten million, two hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •