Base | Representation |
---|---|
bin | 100001001011000… |
… | …100001111000001 |
3 | 1102210020121210001 |
4 | 201023010033001 |
5 | 2114434032212 |
6 | 131120440001 |
7 | 16535406001 |
oct | 4113041701 |
9 | 1383217701 |
10 | 556549057 |
11 | 2661805a9 |
12 | 136479001 |
13 | 8b3c438c |
14 | 53cb6001 |
15 | 33cd8657 |
hex | 212c43c1 |
556549057 has 2 divisors, whose sum is σ = 556549058. Its totient is φ = 556549056.
The previous prime is 556549039. The next prime is 556549073. The reversal of 556549057 is 750945655.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 447576336 + 108972721 = 21156^2 + 10439^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-556549057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 556548998 and 556549016.
It is not a weakly prime, because it can be changed into another prime (556540057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278274528 + 278274529.
It is an arithmetic number, because the mean of its divisors is an integer number (278274529).
Almost surely, 2556549057 is an apocalyptic number.
It is an amenable number.
556549057 is a deficient number, since it is larger than the sum of its proper divisors (1).
556549057 is an equidigital number, since it uses as much as digits as its factorization.
556549057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945000, while the sum is 46.
The square root of 556549057 is about 23591.2919739467. The cubic root of 556549057 is about 822.5604366735.
The spelling of 556549057 in words is "five hundred fifty-six million, five hundred forty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •