Base | Representation |
---|---|
bin | 1011111011001010101110… |
… | …1110001100110000011000 |
3 | 1201102102002120122110220222 |
4 | 2332302223232030300120 |
5 | 3204303034011432300 |
6 | 43515055501335212 |
7 | 2522150543262050 |
oct | 276625356146030 |
9 | 51372076573828 |
10 | 13111121202200 |
11 | 41a543912669a |
12 | 1579033b67508 |
13 | 7414b154a678 |
14 | 3348200a6560 |
15 | 17b0b4e02785 |
hex | becabb8cc18 |
13111121202200 has 96 divisors (see below), whose sum is σ = 35648311100160. Its totient is φ = 4390701033600.
The previous prime is 13111121202181. The next prime is 13111121202241. The reversal of 13111121202200 is 220212111131.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 108836156 + ... + 108956555.
It is an arithmetic number, because the mean of its divisors is an integer number (371336573960).
Almost surely, 213111121202200 is an apocalyptic number.
13111121202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13111121202200 is an abundant number, since it is smaller than the sum of its proper divisors (22537189897960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111121202200 is a wasteful number, since it uses less digits than its factorization.
13111121202200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217792777 (or 217792768 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 13111121202200 its reverse (220212111131), we get a palindrome (13331333313331).
The spelling of 13111121202200 in words is "thirteen trillion, one hundred eleven billion, one hundred twenty-one million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •