Base | Representation |
---|---|
bin | 100000110010000… |
… | …111110011001001 |
3 | 1102022221101221212 |
4 | 200302013303021 |
5 | 2111300310212 |
6 | 130324342505 |
7 | 16426002602 |
oct | 4062076311 |
9 | 1368841855 |
10 | 550010057 |
11 | 262514773 |
12 | 134244a35 |
13 | 89c44c4c |
14 | 53092da9 |
15 | 33445e22 |
hex | 20c87cc9 |
550010057 has 2 divisors, whose sum is σ = 550010058. Its totient is φ = 550010056.
The previous prime is 550009997. The next prime is 550010089. The reversal of 550010057 is 750010055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 327284281 + 222725776 = 18091^2 + 14924^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550010057 is a prime.
It is a super-2 number, since 2×5500100572 = 605022125602286498, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (550010557) 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, 275005028 + 275005029.
It is an arithmetic number, because the mean of its divisors is an integer number (275005029).
Almost surely, 2550010057 is an apocalyptic number.
It is an amenable number.
550010057 is a deficient number, since it is larger than the sum of its proper divisors (1).
550010057 is an equidigital number, since it uses as much as digits as its factorization.
550010057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 875, while the sum is 23.
The square root of 550010057 is about 23452.2932140974. The cubic root of 550010057 is about 819.3262644575.
The spelling of 550010057 in words is "five hundred fifty million, ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •