Base | Representation |
---|---|
bin | 10000000001011100011… |
… | …01011111011101100001 |
3 | 1221122000110101200121121 |
4 | 20000232031133131201 |
5 | 33004441430240221 |
6 | 1100524400052241 |
7 | 54526450106146 |
oct | 10005615373541 |
9 | 1848013350547 |
10 | 550531102561 |
11 | 1a252a500790 |
12 | 8a843904081 |
13 | 3cbb7c4266b |
14 | 1c9082c43cd |
15 | e4c1e36a41 |
hex | 802e35f761 |
550531102561 has 32 divisors (see below), whose sum is σ = 611456864256. Its totient is φ = 491478624000.
The previous prime is 550531102559. The next prime is 550531102573. The reversal of 550531102561 is 165201135055.
It is a cyclic number.
It is not a de Polignac number, because 550531102561 - 21 = 550531102559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550531102531) 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 31 ways as a sum of consecutive naturals, for example, 308074710 + ... + 308076496.
It is an arithmetic number, because the mean of its divisors is an integer number (19108027008).
Almost surely, 2550531102561 is an apocalyptic number.
It is an amenable number.
550531102561 is a deficient number, since it is larger than the sum of its proper divisors (60925761695).
550531102561 is a wasteful number, since it uses less digits than its factorization.
550531102561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3213.
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 550531102561 in words is "five hundred fifty billion, five hundred thirty-one million, one hundred two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •