Base | Representation |
---|---|
bin | 100001001111111… |
… | …011110001000001 |
3 | 1102212122110011111 |
4 | 201033323301001 |
5 | 2120300400324 |
6 | 131204043321 |
7 | 16552302133 |
oct | 4117736101 |
9 | 1385573144 |
10 | 557825089 |
11 | 266972278 |
12 | 136993541 |
13 | 8b750123 |
14 | 54129053 |
15 | 33e8b794 |
hex | 213fbc41 |
557825089 has 2 divisors, whose sum is σ = 557825090. Its totient is φ = 557825088.
The previous prime is 557825087. The next prime is 557825119. The reversal of 557825089 is 980528755.
557825089 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., 473497600 + 84327489 = 21760^2 + 9183^2 .
It is a cyclic number.
It is not a de Polignac number, because 557825089 - 21 = 557825087 is a prime.
It is a super-3 number, since 3×5578250893 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 557825087, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (557825087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278912544 + 278912545.
It is an arithmetic number, because the mean of its divisors is an integer number (278912545).
Almost surely, 2557825089 is an apocalyptic number.
It is an amenable number.
557825089 is a deficient number, since it is larger than the sum of its proper divisors (1).
557825089 is an equidigital number, since it uses as much as digits as its factorization.
557825089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008000, while the sum is 49.
The square root of 557825089 is about 23618.3210453241. The cubic root of 557825089 is about 823.1886006999.
The spelling of 557825089 in words is "five hundred fifty-seven million, eight hundred twenty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •