Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …00110000010001010000 |
3 | 1221121221022210221120011 |
4 | 20000230120300101100 |
5 | 33004411112004220 |
6 | 1100521344124304 |
7 | 54525626022403 |
oct | 10005430602120 |
9 | 1847838727504 |
10 | 550500500560 |
11 | 1a25141a9a7a |
12 | 8a835606694 |
13 | 3cbb17b967a |
14 | 1c9041d9d3a |
15 | e4be3de65a |
hex | 802c630450 |
550500500560 has 20 divisors (see below), whose sum is σ = 1279913663988. Its totient is φ = 220200200192.
The previous prime is 550500500521. The next prime is 550500500569. The reversal of 550500500560 is 65005005055.
It can be written as a sum of positive squares in 2 ways, for example, as 403799244304 + 146701256256 = 635452^2 + 383016^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×5505005005602 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550500500569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3440628049 + ... + 3440628208.
Almost surely, 2550500500560 is an apocalyptic number.
It is an amenable number.
550500500560 is an abundant number, since it is smaller than the sum of its proper divisors (729413163428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550500500560 is a wasteful number, since it uses less digits than its factorization.
550500500560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6881256270 (or 6881256264 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 31.
The spelling of 550500500560 in words is "five hundred fifty billion, five hundred million, five hundred thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •