Base | Representation |
---|---|
bin | 1001100101111011… |
… | …01101111010101101 |
3 | 111021220122110102102 |
4 | 10302331231322231 |
5 | 41021400210312 |
6 | 2211010304445 |
7 | 241423223354 |
oct | 46275557255 |
9 | 14256573372 |
10 | 5150006957 |
11 | 22030544a7 |
12 | bb8888125 |
13 | 640c609c4 |
14 | 36bd8c99b |
15 | 2021d7ec2 |
hex | 132f6dead |
5150006957 has 2 divisors, whose sum is σ = 5150006958. Its totient is φ = 5150006956.
The previous prime is 5150006947. The next prime is 5150006959. The reversal of 5150006957 is 7596000515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2867174116 + 2282832841 = 53546^2 + 47779^2 .
It is a cyclic number.
It is not a de Polignac number, because 5150006957 - 24 = 5150006941 is a prime.
Together with 5150006959, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5150006957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5150006959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2575003478 + 2575003479.
It is an arithmetic number, because the mean of its divisors is an integer number (2575003479).
Almost surely, 25150006957 is an apocalyptic number.
It is an amenable number.
5150006957 is a deficient number, since it is larger than the sum of its proper divisors (1).
5150006957 is an equidigital number, since it uses as much as digits as its factorization.
5150006957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47250, while the sum is 38.
The square root of 5150006957 is about 71763.5489437361. The cubic root of 5150006957 is about 1726.9082803459.
The spelling of 5150006957 in words is "five billion, one hundred fifty million, six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •