Base | Representation |
---|---|
bin | 10000000001011111111… |
… | …11100010101001000101 |
3 | 1221122002112122122012100 |
4 | 20000233333202221011 |
5 | 33010022104000010 |
6 | 1100531344542313 |
7 | 54530262166542 |
oct | 10005777425105 |
9 | 1848075578170 |
10 | 550561000005 |
11 | 1a2545371115 |
12 | 8a851921999 |
13 | 3cbc11aca63 |
14 | 1c90c267bc9 |
15 | e4c48902c0 |
hex | 802ffe2a45 |
550561000005 has 24 divisors (see below), whose sum is σ = 954446746968. Its totient is φ = 293589144576.
The previous prime is 550560999983. The next prime is 550561000019. The reversal of 550561000005 is 500000165055.
550561000005 is a `hidden beast` number, since 550 + 5 + 6 + 100 + 0 + 0 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 21889498401 + 528671501604 = 147951^2 + 727098^2 .
It is not a de Polignac number, because 550561000005 - 25 = 550560999973 is a prime.
It is a super-2 number, since 2×5505610000052 (a number of 24 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 594852 + ... + 1206221.
It is an arithmetic number, because the mean of its divisors is an integer number (39768614457).
Almost surely, 2550561000005 is an apocalyptic number.
It is an amenable number.
550561000005 is a deficient number, since it is larger than the sum of its proper divisors (403885746963).
550561000005 is a wasteful number, since it uses less digits than its factorization.
550561000005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1807877 (or 1807874 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 550561000005 in words is "five hundred fifty billion, five hundred sixty-one million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •