Base | Representation |
---|---|
bin | 1001100010011110… |
… | …1000001101001101 |
3 | 20121110002011011012 |
4 | 2120213220031031 |
5 | 20220443301013 |
6 | 1102024535005 |
7 | 120311050565 |
oct | 23047501515 |
9 | 6543064135 |
10 | 2560525133 |
11 | 10a4393481 |
12 | 5b5621465 |
13 | 31a63143a |
14 | 1a40c7da5 |
15 | eebd41a8 |
hex | 989e834d |
2560525133 has 2 divisors, whose sum is σ = 2560525134. Its totient is φ = 2560525132.
The previous prime is 2560525127. The next prime is 2560525223. The reversal of 2560525133 is 3315250652.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2557628329 + 2896804 = 50573^2 + 1702^2 .
It is a cyclic number.
It is not a de Polignac number, because 2560525133 - 28 = 2560524877 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2560525133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2560525733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1280262566 + 1280262567.
It is an arithmetic number, because the mean of its divisors is an integer number (1280262567).
Almost surely, 22560525133 is an apocalyptic number.
It is an amenable number.
2560525133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2560525133 is an equidigital number, since it uses as much as digits as its factorization.
2560525133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 32.
The square root of 2560525133 is about 50601.6317227024. The cubic root of 2560525133 is about 1368.0742889461.
Adding to 2560525133 its reverse (3315250652), we get a palindrome (5875775785).
The spelling of 2560525133 in words is "two billion, five hundred sixty million, five hundred twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •