Base | Representation |
---|---|
bin | 101000110010010010011… |
… | …0100010001110100101110 |
3 | 201211212220102021200020112 |
4 | 1101210210310101310232 |
5 | 1213320131300134200 |
6 | 15531053142420022 |
7 | 1115662516611305 |
oct | 121444464216456 |
9 | 21755812250215 |
10 | 5605550005550 |
11 | 1871333929400 |
12 | 766487431612 |
13 | 3187a77c3211 |
14 | 15544ab7d43c |
15 | 9ac2e93a535 |
hex | 51924d11d2e |
5605550005550 has 36 divisors (see below), whose sum is σ = 11460338527848. Its totient is φ = 2038381818000.
The previous prime is 5605550005547. The next prime is 5605550005567. The reversal of 5605550005550 is 555000555065.
It is a junction number, because it is equal to n+sod(n) for n = 5605550005498 and 5605550005507.
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 17 ways as a sum of consecutive naturals, for example, 463262546 + ... + 463274645.
Almost surely, 25605550005550 is an apocalyptic number.
5605550005550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5605550005550 is an abundant number, since it is smaller than the sum of its proper divisors (5854788522298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5605550005550 is a wasteful number, since it uses less digits than its factorization.
5605550005550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926537225 (or 926537209 counting only the distinct ones).
The product of its (nonzero) digits is 468750, while the sum is 41.
The spelling of 5605550005550 in words is "five trillion, six hundred five billion, five hundred fifty million, five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •