Base | Representation |
---|---|
bin | 1010010011100100000011… |
… | …1011101111100111011000 |
3 | 1111010020211201121000012210 |
4 | 2210321000323233213120 |
5 | 2441122311030131300 |
6 | 40033253142235120 |
7 | 2246440011300405 |
oct | 244710073574730 |
9 | 44106751530183 |
10 | 11331213130200 |
11 | 36795a4453987 |
12 | 1330094425aa0 |
13 | 6426b4a58772 |
14 | 2b260dcad2ac |
15 | 149b3e223050 |
hex | a4e40eef9d8 |
11331213130200 has 96 divisors (see below), whose sum is σ = 36259882076160. Its totient is φ = 2924184028800.
The previous prime is 11331213130157. The next prime is 11331213130213. The reversal of 11331213130200 is 203131213311.
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, 304583904 + ... + 304621103.
It is an arithmetic number, because the mean of its divisors is an integer number (377707104960).
Almost surely, 211331213130200 is an apocalyptic number.
11331213130200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11331213130200 is an abundant number, since it is smaller than the sum of its proper divisors (24928668945960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331213130200 is a wasteful number, since it uses less digits than its factorization.
11331213130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609205057 (or 609205048 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11331213130200 its reverse (203131213311), we get a palindrome (11534344343511).
The spelling of 11331213130200 in words is "eleven trillion, three hundred thirty-one billion, two hundred thirteen million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •