Base | Representation |
---|---|
bin | 1011111011001010010110… |
… | …1101011010100011110100 |
3 | 1201102101211112211210210210 |
4 | 2332302211231122203310 |
5 | 3204302332201131200 |
6 | 43515041455345420 |
7 | 2522145210020451 |
oct | 276624555324364 |
9 | 51371745753723 |
10 | 13111020333300 |
11 | 41a53971a136a |
12 | 1579006222270 |
13 | 741496691526 |
14 | 33481092a828 |
15 | 17b0ab12a650 |
hex | beca5b5a8f4 |
13111020333300 has 288 divisors, whose sum is σ = 39474829004800. Its totient is φ = 3356857520640.
The previous prime is 13111020333289. The next prime is 13111020333317. The reversal of 13111020333300 is 333302011131.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2331674289 + ... + 2331679911.
Almost surely, 213111020333300 is an apocalyptic number.
13111020333300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13111020333300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19737414502400).
13111020333300 is an abundant number, since it is smaller than the sum of its proper divisors (26363808671500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111020333300 is a wasteful number, since it uses less digits than its factorization.
13111020333300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8415 (or 8408 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13111020333300 its reverse (333302011131), we get a palindrome (13444322344431).
The spelling of 13111020333300 in words is "thirteen trillion, one hundred eleven billion, twenty million, three hundred thirty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •