Base | Representation |
---|---|
bin | 1010001100001011000011… |
… | …0001010001011101010110 |
3 | 1110200010002210000202000120 |
4 | 2203002300301101131112 |
5 | 2432032241021231200 |
6 | 35455053524252410 |
7 | 2234323344104061 |
oct | 243026061213526 |
9 | 43603083022016 |
10 | 11204240414550 |
11 | 362a767690347 |
12 | 130b559541106 |
13 | 63372b0cc361 |
14 | 2aa4068ad8d8 |
15 | 1466ac0429a0 |
hex | a30b0c51756 |
11204240414550 has 24 divisors (see below), whose sum is σ = 27786516228456. Its totient is φ = 2987797443840.
The previous prime is 11204240414527. The next prime is 11204240414579. The reversal of 11204240414550 is 5541404240211.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 37347467899 + ... + 37347468198.
It is an arithmetic number, because the mean of its divisors is an integer number (1157771509519).
Almost surely, 211204240414550 is an apocalyptic number.
11204240414550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11204240414550 is an abundant number, since it is smaller than the sum of its proper divisors (16582275813906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11204240414550 is a wasteful number, since it uses less digits than its factorization.
11204240414550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74694936112 (or 74694936107 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 33.
Adding to 11204240414550 its reverse (5541404240211), we get a palindrome (16745644654761).
The spelling of 11204240414550 in words is "eleven trillion, two hundred four billion, two hundred forty million, four hundred fourteen thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •