Base | Representation |
---|---|
bin | 111110111100100… |
… | …111001100010001 |
3 | 2201121012020200201 |
4 | 332330213030101 |
5 | 4130323422221 |
6 | 252443215201 |
7 | 35112334261 |
oct | 7674471421 |
9 | 2647166621 |
10 | 1056076561 |
11 | 4a2144a51 |
12 | 255817501 |
13 | 13aa42397 |
14 | a03877a1 |
15 | 62aab891 |
hex | 3ef27311 |
1056076561 has 2 divisors, whose sum is σ = 1056076562. Its totient is φ = 1056076560.
The previous prime is 1056076523. The next prime is 1056076573. The reversal of 1056076561 is 1656706501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 945931536 + 110145025 = 30756^2 + 10495^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056076561 - 27 = 1056076433 is a prime.
It is a super-2 number, since 2×10560765612 = 2230595405387173442, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1056076561.
It is not a weakly prime, because it can be changed into another prime (1056076361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528038280 + 528038281.
It is an arithmetic number, because the mean of its divisors is an integer number (528038281).
Almost surely, 21056076561 is an apocalyptic number.
It is an amenable number.
1056076561 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056076561 is an equidigital number, since it uses as much as digits as its factorization.
1056076561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 37.
The square root of 1056076561 is about 32497.3315981482. The cubic root of 1056076561 is about 1018.3532832682.
The spelling of 1056076561 in words is "one billion, fifty-six million, seventy-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •