Base | Representation |
---|---|
bin | 1010001101001010101001… |
… | …0001010110100001000110 |
3 | 1110201202011110211011101211 |
4 | 2203102222101112201012 |
5 | 2432322221140040200 |
6 | 35510555455442034 |
7 | 2235466360612060 |
oct | 243225221264106 |
9 | 43652143734354 |
10 | 11221311252550 |
11 | 3636a27732623 |
12 | 131292252631a |
13 | 63521b995829 |
14 | 2ab185b4c730 |
15 | 146d5aa5daba |
hex | a34aa456846 |
11221311252550 has 24 divisors (see below), whose sum is σ = 23853301634736. Its totient is φ = 3847306715040.
The previous prime is 11221311252533. The next prime is 11221311252563. The reversal of 11221311252550 is 5525211312211.
It is a congruent number.
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, 16030444297 + ... + 16030444996.
It is an arithmetic number, because the mean of its divisors is an integer number (993887568114).
Almost surely, 211221311252550 is an apocalyptic number.
11221311252550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11221311252550 is an abundant number, since it is smaller than the sum of its proper divisors (12631990382186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221311252550 is a wasteful number, since it uses less digits than its factorization.
11221311252550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32060889312 (or 32060889307 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 31.
Adding to 11221311252550 its reverse (5525211312211), we get a palindrome (16746522564761).
It can be divided in two parts, 1122131 and 1252550, that added together give a square (2374681 = 15412).
The spelling of 11221311252550 in words is "eleven trillion, two hundred twenty-one billion, three hundred eleven million, two hundred fifty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •