Base | Representation |
---|---|
bin | 1010001101000110010000… |
… | …0011111100000100001010 |
3 | 1110201122010101100120002112 |
4 | 2203101210003330010022 |
5 | 2432312313113044320 |
6 | 35510242540502322 |
7 | 2235425235501056 |
oct | 243214403740412 |
9 | 43648111316075 |
10 | 11220133331210 |
11 | 3636482836911 |
12 | 1312653b4a9a2 |
13 | 63509193195b |
14 | 2ab0b3528c66 |
15 | 146cdc434ec5 |
hex | a34640fc10a |
11220133331210 has 8 divisors (see below), whose sum is σ = 20196239996196. Its totient is φ = 4488053332480.
The previous prime is 11220133331203. The next prime is 11220133331279. The reversal of 11220133331210 is 1213333102211.
It can be written as a sum of positive squares in 2 ways, for example, as 9755871186721 + 1464262144489 = 3123439^2 + 1210067^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112201333312102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 561006666551 + ... + 561006666570.
Almost surely, 211220133331210 is an apocalyptic number.
11220133331210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11220133331210 is a deficient number, since it is larger than the sum of its proper divisors (8976106664986).
11220133331210 is a wasteful number, since it uses less digits than its factorization.
11220133331210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122013333128.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11220133331210 its reverse (1213333102211), we get a palindrome (12433466433421).
The spelling of 11220133331210 in words is "eleven trillion, two hundred twenty billion, one hundred thirty-three million, three hundred thirty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •