Base | Representation |
---|---|
bin | 1001010101010100… |
… | …0010100001011001 |
3 | 20110121012110200112 |
4 | 2111111002201121 |
5 | 20112330224122 |
6 | 1052333414105 |
7 | 116040605336 |
oct | 22525024131 |
9 | 6417173615 |
10 | 2505320537 |
11 | 1076208445 |
12 | 59b03a335 |
13 | 30c0730b5 |
14 | 19aa3798d |
15 | e9e2c2e2 |
hex | 95542859 |
2505320537 has 2 divisors, whose sum is σ = 2505320538. Its totient is φ = 2505320536.
The previous prime is 2505320509. The next prime is 2505320591. The reversal of 2505320537 is 7350235052.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2472476176 + 32844361 = 49724^2 + 5731^2 .
It is a cyclic number.
It is not a de Polignac number, because 2505320537 - 210 = 2505319513 is a prime.
It is a super-2 number, since 2×25053205372 = 12553261986227936738, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2505320437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1252660268 + 1252660269.
It is an arithmetic number, because the mean of its divisors is an integer number (1252660269).
Almost surely, 22505320537 is an apocalyptic number.
It is an amenable number.
2505320537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2505320537 is an equidigital number, since it uses as much as digits as its factorization.
2505320537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 32.
The square root of 2505320537 is about 50053.1770919689. The cubic root of 2505320537 is about 1358.1709367054.
Adding to 2505320537 its reverse (7350235052), we get a palindrome (9855555589).
The spelling of 2505320537 in words is "two billion, five hundred five million, three hundred twenty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •