Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …00110000010001011001 |
3 | 1221121221022210221120111 |
4 | 20000230120300101121 |
5 | 33004411112004234 |
6 | 1100521344124321 |
7 | 54525626022415 |
oct | 10005430602131 |
9 | 1847838727514 |
10 | 550500500569 |
11 | 1a25141a9a88 |
12 | 8a8356066a1 |
13 | 3cbb17b9686 |
14 | 1c9041d9d45 |
15 | e4be3de664 |
hex | 802c630459 |
550500500569 has 2 divisors, whose sum is σ = 550500500570. Its totient is φ = 550500500568.
The previous prime is 550500500521. The next prime is 550500500617. The reversal of 550500500569 is 965005005055.
It is a balanced prime because it is at equal distance from previous prime (550500500521) and next prime (550500500617).
It can be written as a sum of positive squares in only one way, i.e., 549258854400 + 1241646169 = 741120^2 + 35237^2 .
It is a cyclic number.
It is not a de Polignac number, because 550500500569 - 231 = 548353016921 is a prime.
It is a super-2 number, since 2×5505005005692 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (550500000569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275250250284 + 275250250285.
It is an arithmetic number, because the mean of its divisors is an integer number (275250250285).
Almost surely, 2550500500569 is an apocalyptic number.
It is an amenable number.
550500500569 is a deficient number, since it is larger than the sum of its proper divisors (1).
550500500569 is an equidigital number, since it uses as much as digits as its factorization.
550500500569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168750, while the sum is 40.
The spelling of 550500500569 in words is "five hundred fifty billion, five hundred million, five hundred thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •