Base | Representation |
---|---|
bin | 1001010101010111… |
… | …0101110010101001 |
3 | 20110121121010202022 |
4 | 2111111311302221 |
5 | 20112403434122 |
6 | 1052342114225 |
7 | 116042441516 |
oct | 22525656251 |
9 | 6417533668 |
10 | 2505530537 |
11 | 10763411a4 |
12 | 59b11b975 |
13 | 30c117863 |
14 | 19aa9030d |
15 | e9e6e642 |
hex | 95575ca9 |
2505530537 has 2 divisors, whose sum is σ = 2505530538. Its totient is φ = 2505530536.
The previous prime is 2505530477. The next prime is 2505530543. The reversal of 2505530537 is 7350355052.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2281399696 + 224130841 = 47764^2 + 14971^2 .
It is a cyclic number.
It is not a de Polignac number, because 2505530537 - 230 = 1431788713 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2505530497 and 2505530506.
It is not a weakly prime, because it can be changed into another prime (2505530557) 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, 1252765268 + 1252765269.
It is an arithmetic number, because the mean of its divisors is an integer number (1252765269).
Almost surely, 22505530537 is an apocalyptic number.
It is an amenable number.
2505530537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2505530537 is an equidigital number, since it uses as much as digits as its factorization.
2505530537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78750, while the sum is 35.
The square root of 2505530537 is about 50055.2748169461. The cubic root of 2505530537 is about 1358.2088836699.
Adding to 2505530537 its reverse (7350355052), we get a palindrome (9855885589).
The spelling of 2505530537 in words is "two billion, five hundred five million, five hundred thirty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •