Base | Representation |
---|---|
bin | 110011010001100100… |
… | …010001101111011101 |
3 | 12021002220202000001222 |
4 | 303101210101233131 |
5 | 1400223210234144 |
6 | 41143035343125 |
7 | 3656220333521 |
oct | 632144215735 |
9 | 167086660058 |
10 | 55055555549 |
11 | 21392475835 |
12 | a805bb1aa5 |
13 | 5265280607 |
14 | 2943d33d81 |
15 | 16736222ee |
hex | cd1911bdd |
55055555549 has 8 divisors (see below), whose sum is σ = 55352484768. Its totient is φ = 54759103920.
The previous prime is 55055555539. The next prime is 55055555563. The reversal of 55055555549 is 94555555055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55055555549 - 232 = 50760588253 is a prime.
It is a super-2 number, since 2×550555555492 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55055555549.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55055555539) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 112994 + ... + 350540.
It is an arithmetic number, because the mean of its divisors is an integer number (6919060596).
Almost surely, 255055555549 is an apocalyptic number.
It is an amenable number.
55055555549 is a deficient number, since it is larger than the sum of its proper divisors (296929219).
55055555549 is a wasteful number, since it uses less digits than its factorization.
55055555549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238795.
The product of its (nonzero) digits is 14062500, while the sum is 53.
The spelling of 55055555549 in words is "fifty-five billion, fifty-five million, five hundred fifty-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •