Base | Representation |
---|---|
bin | 100000110111110… |
… | …101001010110001 |
3 | 1102102202102211201 |
4 | 200313311022301 |
5 | 2112141202414 |
6 | 130420411201 |
7 | 16444504663 |
oct | 4067651261 |
9 | 1372672751 |
10 | 551506609 |
11 | 263347095 |
12 | 134846b01 |
13 | 8a34a194 |
14 | 53362533 |
15 | 3363e574 |
hex | 20df52b1 |
551506609 has 2 divisors, whose sum is σ = 551506610. Its totient is φ = 551506608.
The previous prime is 551506607. The next prime is 551506633. The reversal of 551506609 is 906605155.
551506609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 489648384 + 61858225 = 22128^2 + 7865^2 .
It is a cyclic number.
It is not a de Polignac number, because 551506609 - 21 = 551506607 is a prime.
Together with 551506607, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (551506603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275753304 + 275753305.
It is an arithmetic number, because the mean of its divisors is an integer number (275753305).
Almost surely, 2551506609 is an apocalyptic number.
It is an amenable number.
551506609 is a deficient number, since it is larger than the sum of its proper divisors (1).
551506609 is an equidigital number, since it uses as much as digits as its factorization.
551506609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 37.
The square root of 551506609 is about 23484.1778438165. The cubic root of 551506609 is about 820.0687078062.
The spelling of 551506609 in words is "five hundred fifty-one million, five hundred six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •