Base | Representation |
---|---|
bin | 100000110011101… |
… | …101001111110101 |
3 | 1102100201111221221 |
4 | 200303231033311 |
5 | 2111402104324 |
6 | 130341310341 |
7 | 16432353220 |
oct | 4063551765 |
9 | 1370644857 |
10 | 550425589 |
11 | 26277898a |
12 | 1344053b1 |
13 | 8a05c11c |
14 | 531605b7 |
15 | 334c90e4 |
hex | 20ced3f5 |
550425589 has 4 divisors (see below), whose sum is σ = 629057824. Its totient is φ = 471793356.
The previous prime is 550425587. The next prime is 550425593. The reversal of 550425589 is 985524055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 985524055 = 5 ⋅197104811.
It is a cyclic number.
It is not a de Polignac number, because 550425589 - 21 = 550425587 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550425587) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39316107 + ... + 39316120.
It is an arithmetic number, because the mean of its divisors is an integer number (157264456).
Almost surely, 2550425589 is an apocalyptic number.
It is an amenable number.
550425589 is a deficient number, since it is larger than the sum of its proper divisors (78632235).
550425589 is an equidigital number, since it uses as much as digits as its factorization.
550425589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78632234.
The product of its (nonzero) digits is 360000, while the sum is 43.
The square root of 550425589 is about 23461.1506324818. The cubic root of 550425589 is about 819.5325458850.
The spelling of 550425589 in words is "five hundred fifty million, four hundred twenty-five thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •