Base | Representation |
---|---|
bin | 1001011010000100… |
… | …0000010101010001 |
3 | 20111222200012112012 |
4 | 2112201000111101 |
5 | 20132430001023 |
6 | 1054324312305 |
7 | 116402065514 |
oct | 22641002521 |
9 | 6458605465 |
10 | 2525234513 |
11 | 108647a07a |
12 | 5a5842695 |
13 | 313226309 |
14 | 19d53cd7b |
15 | eba62978 |
hex | 96840551 |
2525234513 has 2 divisors, whose sum is σ = 2525234514. Its totient is φ = 2525234512.
The previous prime is 2525234461. The next prime is 2525234527. The reversal of 2525234513 is 3154325252.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1930459969 + 594774544 = 43937^2 + 24388^2 .
It is a cyclic number.
It is not a de Polignac number, because 2525234513 - 210 = 2525233489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2525234513.
It is not a weakly prime, because it can be changed into another prime (2525234533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1262617256 + 1262617257.
It is an arithmetic number, because the mean of its divisors is an integer number (1262617257).
Almost surely, 22525234513 is an apocalyptic number.
It is an amenable number.
2525234513 is a deficient number, since it is larger than the sum of its proper divisors (1).
2525234513 is an equidigital number, since it uses as much as digits as its factorization.
2525234513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36000, while the sum is 32.
The square root of 2525234513 is about 50251.7115429912. The cubic root of 2525234513 is about 1361.7599966458.
Adding to 2525234513 its reverse (3154325252), we get a palindrome (5679559765).
The spelling of 2525234513 in words is "two billion, five hundred twenty-five million, two hundred thirty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •