Base | Representation |
---|---|
bin | 1010010110110100… |
… | …11111010101000001 |
3 | 112100111111120000012 |
4 | 11023122133111001 |
5 | 42341402440221 |
6 | 2315422234305 |
7 | 254533641044 |
oct | 51332372501 |
9 | 15314446005 |
10 | 5560202561 |
11 | 23a3653531 |
12 | 10b2125995 |
13 | 6a7c31bb4 |
14 | 3aa648c5b |
15 | 22821265b |
hex | 14b69f541 |
5560202561 has 2 divisors, whose sum is σ = 5560202562. Its totient is φ = 5560202560.
The previous prime is 5560202519. The next prime is 5560202603. The reversal of 5560202561 is 1652020655.
It is a balanced prime because it is at equal distance from previous prime (5560202519) and next prime (5560202603).
It can be written as a sum of positive squares in only one way, i.e., 3696640000 + 1863562561 = 60800^2 + 43169^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5560202561 is a prime.
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 (5560202761) 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, 2780101280 + 2780101281.
It is an arithmetic number, because the mean of its divisors is an integer number (2780101281).
Almost surely, 25560202561 is an apocalyptic number.
It is an amenable number.
5560202561 is a deficient number, since it is larger than the sum of its proper divisors (1).
5560202561 is an equidigital number, since it uses as much as digits as its factorization.
5560202561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 5560202561 is about 74566.7657941526. The cubic root of 5560202561 is about 1771.5912956975.
The spelling of 5560202561 in words is "five billion, five hundred sixty million, two hundred two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •