Base | Representation |
---|---|
bin | 1001011100001011… |
… | …1100101100111001 |
3 | 20112121102021022122 |
4 | 2113002330230321 |
5 | 20142214220122 |
6 | 1055243131025 |
7 | 116540525336 |
oct | 22702745471 |
9 | 6477367278 |
10 | 2534132537 |
11 | 10904a7312 |
12 | 5a8813a75 |
13 | 315020411 |
14 | 1a07b798d |
15 | ec71e142 |
hex | 970bcb39 |
2534132537 has 2 divisors, whose sum is σ = 2534132538. Its totient is φ = 2534132536.
The previous prime is 2534132527. The next prime is 2534132563. The reversal of 2534132537 is 7352314352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1983009961 + 551122576 = 44531^2 + 23476^2 .
It is a cyclic number.
It is not a de Polignac number, because 2534132537 - 214 = 2534116153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2534132497 and 2534132506.
It is not a weakly prime, because it can be changed into another prime (2534132527) 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, 1267066268 + 1267066269.
It is an arithmetic number, because the mean of its divisors is an integer number (1267066269).
Almost surely, 22534132537 is an apocalyptic number.
It is an amenable number.
2534132537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2534132537 is an equidigital number, since it uses as much as digits as its factorization.
2534132537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75600, while the sum is 35.
The square root of 2534132537 is about 50340.1682257817. The cubic root of 2534132537 is about 1363.3575735447.
Adding to 2534132537 its reverse (7352314352), we get a palindrome (9886446889).
The spelling of 2534132537 in words is "two billion, five hundred thirty-four million, one hundred thirty-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •