Base | Representation |
---|---|
bin | 1001100111000111… |
… | …11111100001011001 |
3 | 111022121112012220111 |
4 | 10303203333201121 |
5 | 41031432244122 |
6 | 2212005324321 |
7 | 241604422651 |
oct | 46343774131 |
9 | 14277465814 |
10 | 5160040537 |
11 | 2208787913 |
12 | 10001066a1 |
13 | 643064932 |
14 | 36d441361 |
15 | 20301ad77 |
hex | 1338ff859 |
5160040537 has 2 divisors, whose sum is σ = 5160040538. Its totient is φ = 5160040536.
The previous prime is 5160040531. The next prime is 5160040579. The reversal of 5160040537 is 7350400615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4414805136 + 745235401 = 66444^2 + 27299^2 .
It is a cyclic number.
It is not a de Polignac number, because 5160040537 - 211 = 5160038489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5160040499 and 5160040508.
It is not a weakly prime, because it can be changed into another prime (5160040531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580020268 + 2580020269.
It is an arithmetic number, because the mean of its divisors is an integer number (2580020269).
Almost surely, 25160040537 is an apocalyptic number.
It is an amenable number.
5160040537 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160040537 is an equidigital number, since it uses as much as digits as its factorization.
5160040537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 5160040537 is about 71833.4221445700. The cubic root of 5160040537 is about 1728.0290446552.
The spelling of 5160040537 in words is "five billion, one hundred sixty million, forty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •