Base | Representation |
---|---|
bin | 111111011110111… |
… | …1101101001111001 |
3 | 12111110021222101011 |
4 | 1332331331221321 |
5 | 13330311010122 |
6 | 551212553521 |
7 | 103534111363 |
oct | 17675755171 |
9 | 5443258334 |
10 | 2130172537 |
11 | 9a3477179 |
12 | 4b54828a1 |
13 | 27c42352c |
14 | 162ca1d33 |
15 | c7027377 |
hex | 7ef7da79 |
2130172537 has 2 divisors, whose sum is σ = 2130172538. Its totient is φ = 2130172536.
The previous prime is 2130172523. The next prime is 2130172549. The reversal of 2130172537 is 7352710312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2054899561 + 75272976 = 45331^2 + 8676^2 .
It is a cyclic number.
It is not a de Polignac number, because 2130172537 - 215 = 2130139769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2130172499 and 2130172508.
It is not a weakly prime, because it can be changed into another prime (2130178537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065086268 + 1065086269.
It is an arithmetic number, because the mean of its divisors is an integer number (1065086269).
Almost surely, 22130172537 is an apocalyptic number.
It is an amenable number.
2130172537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130172537 is an equidigital number, since it uses as much as digits as its factorization.
2130172537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8820, while the sum is 31.
The square root of 2130172537 is about 46153.7922277249. The cubic root of 2130172537 is about 1286.6830912007.
Adding to 2130172537 its reverse (7352710312), we get a palindrome (9482882849).
The spelling of 2130172537 in words is "two billion, one hundred thirty million, one hundred seventy-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •