Base | Representation |
---|---|
bin | 100000111111011… |
… | …000101011010001 |
3 | 1102120111001111122 |
4 | 200333120223101 |
5 | 2113143041212 |
6 | 130531052025 |
7 | 16500363614 |
oct | 4077305321 |
9 | 1376431448 |
10 | 553487057 |
11 | 26447a022 |
12 | 135441015 |
13 | 8a891746 |
14 | 5371a17b |
15 | 338d1272 |
hex | 20fd8ad1 |
553487057 has 2 divisors, whose sum is σ = 553487058. Its totient is φ = 553487056.
The previous prime is 553487023. The next prime is 553487059. The reversal of 553487057 is 750784355.
It is a happy number.
553487057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 433014481 + 120472576 = 20809^2 + 10976^2 .
It is a cyclic number.
It is not a de Polignac number, because 553487057 - 210 = 553486033 is a prime.
Together with 553487059, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 553486999 and 553487017.
It is not a weakly prime, because it can be changed into another prime (553487059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276743528 + 276743529.
It is an arithmetic number, because the mean of its divisors is an integer number (276743529).
Almost surely, 2553487057 is an apocalyptic number.
It is an amenable number.
553487057 is a deficient number, since it is larger than the sum of its proper divisors (1).
553487057 is an equidigital number, since it uses as much as digits as its factorization.
553487057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 588000, while the sum is 44.
The square root of 553487057 is about 23526.3056385825. The cubic root of 553487057 is about 821.0491513373.
The spelling of 553487057 in words is "five hundred fifty-three million, four hundred eighty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •