Base | Representation |
---|---|
bin | 11001000001000010010011… |
… | …01100011110010101110110 |
3 | 21012210000110112202100221201 |
4 | 30200201021230132111312 |
5 | 24202300342421210200 |
6 | 312555441443003114 |
7 | 14405266155515464 |
oct | 1440411154362566 |
9 | 235700415670851 |
10 | 55011177522550 |
11 | 1658a122633797 |
12 | 620565006949a |
13 | 24906bb428bc2 |
14 | d827ab671834 |
15 | 655e787d9c6a |
hex | 320849b1e576 |
55011177522550 has 24 divisors (see below), whose sum is σ = 105849093304800. Its totient is φ = 21245696146080.
The previous prime is 55011177522517. The next prime is 55011177522551. The reversal of 55011177522550 is 5522577111055.
It is a super-3 number, since 3×550111775225503 (a number of 42 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55011177522550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55011177522551) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18969370110 + ... + 18969373009.
It is an arithmetic number, because the mean of its divisors is an integer number (4410378887700).
Almost surely, 255011177522550 is an apocalyptic number.
55011177522550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55011177522550 is a deficient number, since it is larger than the sum of its proper divisors (50837915782250).
55011177522550 is a wasteful number, since it uses less digits than its factorization.
55011177522550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37938743160 (or 37938743155 counting only the distinct ones).
The product of its (nonzero) digits is 612500, while the sum is 46.
The spelling of 55011177522550 in words is "fifty-five trillion, eleven billion, one hundred seventy-seven million, five hundred twenty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •