Base | Representation |
---|---|
bin | 1001100111010111… |
… | …11011011101001101 |
3 | 111022202102220211001 |
4 | 10303223323131031 |
5 | 41033000333122 |
6 | 2212122100301 |
7 | 241631206363 |
oct | 46353733515 |
9 | 14282386731 |
10 | 5162121037 |
11 | 2209978a37 |
12 | 100094a691 |
13 | 6436128b8 |
14 | 36d823633 |
15 | 2032cc527 |
hex | 133afb74d |
5162121037 has 2 divisors, whose sum is σ = 5162121038. Its totient is φ = 5162121036.
The previous prime is 5162121011. The next prime is 5162121079. The reversal of 5162121037 is 7301212615.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4161411081 + 1000709956 = 64509^2 + 31634^2 .
It is a cyclic number.
It is not a de Polignac number, because 5162121037 - 219 = 5161596749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5162120996 and 5162121014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5162121137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2581060518 + 2581060519.
It is an arithmetic number, because the mean of its divisors is an integer number (2581060519).
Almost surely, 25162121037 is an apocalyptic number.
It is an amenable number.
5162121037 is a deficient number, since it is larger than the sum of its proper divisors (1).
5162121037 is an equidigital number, since it uses as much as digits as its factorization.
5162121037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 5162121037 is about 71847.9021057678. The cubic root of 5162121037 is about 1728.2612573885.
The spelling of 5162121037 in words is "five billion, one hundred sixty-two million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •