Base | Representation |
---|---|
bin | 1111010011111101… |
… | …00110110100100001 |
3 | 210012220021011122122 |
4 | 13221332212310201 |
5 | 113313420024221 |
6 | 3435413114025 |
7 | 410465563322 |
oct | 75176466441 |
9 | 23186234578 |
10 | 8220470561 |
11 | 3539272226 |
12 | 1715028915 |
13 | a10116a84 |
14 | 57da98449 |
15 | 331a49eab |
hex | 1e9fa6d21 |
8220470561 has 2 divisors, whose sum is σ = 8220470562. Its totient is φ = 8220470560.
The previous prime is 8220470537. The next prime is 8220470567. The reversal of 8220470561 is 1650740228.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7113910336 + 1106560225 = 84344^2 + 33265^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8220470561 is a prime.
It is a super-2 number, since 2×82204705612 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (8220470567) 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, 4110235280 + 4110235281.
It is an arithmetic number, because the mean of its divisors is an integer number (4110235281).
Almost surely, 28220470561 is an apocalyptic number.
It is an amenable number.
8220470561 is a deficient number, since it is larger than the sum of its proper divisors (1).
8220470561 is an equidigital number, since it uses as much as digits as its factorization.
8220470561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26880, while the sum is 35.
The square root of 8220470561 is about 90666.8106916748. The cubic root of 8220470561 is about 2018.2063090029.
The spelling of 8220470561 in words is "eight billion, two hundred twenty million, four hundred seventy thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •