Base | Representation |
---|---|
bin | 11001010000101110111000… |
… | …00111101111010100111111 |
3 | 21021200120120012122202101120 |
4 | 30220113130013233110333 |
5 | 24240114413243234201 |
6 | 314051314423442023 |
7 | 14462251205066562 |
oct | 1450273407572477 |
9 | 237616505582346 |
10 | 55550505055551 |
11 | 167779229a5880 |
12 | 62920878b6313 |
13 | 24cc50c209c5c |
14 | da0931a144d9 |
15 | 664ee1d70536 |
hex | 3285dc1ef53f |
55550505055551 has 8 divisors (see below), whose sum is σ = 80800734626304. Its totient is φ = 33666972760920.
The previous prime is 55550505055531. The next prime is 55550505055693. The reversal of 55550505055551 is 15555050505555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-55550505055551 is a prime.
It is a super-2 number, since 2×555505050555512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55550505055494 and 55550505055503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55550505055501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 841674318991 + ... + 841674319056.
It is an arithmetic number, because the mean of its divisors is an integer number (10100091828288).
Almost surely, 255550505055551 is an apocalyptic number.
55550505055551 is a deficient number, since it is larger than the sum of its proper divisors (25250229570753).
55550505055551 is a wasteful number, since it uses less digits than its factorization.
55550505055551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683348638061.
The product of its (nonzero) digits is 9765625, while the sum is 51.
The spelling of 55550505055551 in words is "fifty-five trillion, five hundred fifty billion, five hundred five million, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •