Base | Representation |
---|---|
bin | 1010001101000110001101… |
… | …1001111110100010100100 |
3 | 1110201122002121122201001110 |
4 | 2203101203121332202210 |
5 | 2432312302304100200 |
6 | 35510241505025020 |
7 | 2235425043135261 |
oct | 243214331764244 |
9 | 43648077581043 |
10 | 11220122331300 |
11 | 3636477603483 |
12 | 1312650325170 |
13 | 63508c57cc2c |
14 | 2ab0b1ca4268 |
15 | 146cdb4b0b50 |
hex | a346367e8a4 |
11220122331300 has 36 divisors (see below), whose sum is σ = 32463553946096. Its totient is φ = 2992032621600.
The previous prime is 11220122331289. The next prime is 11220122331311. The reversal of 11220122331300 is 313322102211.
It is an interprime number because it is at equal distance from previous prime (11220122331289) and next prime (11220122331311).
It is a super-2 number, since 2×112201223313002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18700203586 + ... + 18700204185.
Almost surely, 211220122331300 is an apocalyptic number.
11220122331300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11220122331300 is an abundant number, since it is smaller than the sum of its proper divisors (21243431614796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220122331300 is a wasteful number, since it uses less digits than its factorization.
11220122331300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37400407788 (or 37400407781 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11220122331300 its reverse (313322102211), we get a palindrome (11533444433511).
The spelling of 11220122331300 in words is "eleven trillion, two hundred twenty billion, one hundred twenty-two million, three hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •