Base | Representation |
---|---|
bin | 111110111110011… |
… | …110011101000001 |
3 | 2201122010001210011 |
4 | 332332132131001 |
5 | 4130440040212 |
6 | 252501504521 |
7 | 35116440412 |
oct | 7676363501 |
9 | 2648101704 |
10 | 1056565057 |
11 | 4a2448a69 |
12 | 255a12141 |
13 | 13ab83832 |
14 | a0473809 |
15 | 62b564a7 |
hex | 3ef9e741 |
1056565057 has 2 divisors, whose sum is σ = 1056565058. Its totient is φ = 1056565056.
The previous prime is 1056565049. The next prime is 1056565061. The reversal of 1056565057 is 7505656501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1054885441 + 1679616 = 32479^2 + 1296^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056565057 - 23 = 1056565049 is a prime.
It is a super-2 number, since 2×10565650572 = 2232659439346826498, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1056575057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528282528 + 528282529.
It is an arithmetic number, because the mean of its divisors is an integer number (528282529).
Almost surely, 21056565057 is an apocalyptic number.
It is an amenable number.
1056565057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056565057 is an equidigital number, since it uses as much as digits as its factorization.
1056565057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 40.
The square root of 1056565057 is about 32504.8466693815. The cubic root of 1056565057 is about 1018.5102746715.
The spelling of 1056565057 in words is "one billion, fifty-six million, five hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •