Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …11001110111010001111 |
3 | 1221120210022110212011112 |
4 | 20000101313032322033 |
5 | 33003003202134201 |
6 | 1100405250242235 |
7 | 54511613440016 |
oct | 10002167167217 |
9 | 1846708425145 |
10 | 550055505551 |
11 | 1a2305aa1702 |
12 | 8a73058637b |
13 | 3cb40552b06 |
14 | 1c8a1081a7d |
15 | e4952de0bb |
hex | 8011dcee8f |
550055505551 has 4 divisors (see below), whose sum is σ = 554386651392. Its totient is φ = 545724359712.
The previous prime is 550055505541. The next prime is 550055505607. The reversal of 550055505551 is 155505550055.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 550055505551 - 230 = 548981763727 is a prime.
It is a super-2 number, since 2×5500555055512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 550055505499 and 550055505508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550055505541) 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 3 ways as a sum of consecutive naturals, for example, 2165572730 + ... + 2165572983.
It is an arithmetic number, because the mean of its divisors is an integer number (138596662848).
Almost surely, 2550055505551 is an apocalyptic number.
550055505551 is a deficient number, since it is larger than the sum of its proper divisors (4331145841).
550055505551 is a wasteful number, since it uses less digits than its factorization.
550055505551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4331145840.
The product of its (nonzero) digits is 390625, while the sum is 41.
The spelling of 550055505551 in words is "five hundred fifty billion, fifty-five million, five hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •