Base | Representation |
---|---|
bin | 101111100001010111… |
… | …101001101111011011 |
3 | 11212201001212211220102 |
4 | 233201113221233123 |
5 | 1314000040323024 |
6 | 35235122050015 |
7 | 3454315261661 |
oct | 574127515733 |
9 | 155631784812 |
10 | 51025714139 |
11 | 1a70475a294 |
12 | 9a804a990b |
13 | 4a7241117a |
14 | 2680a52c31 |
15 | 14d99551ae |
hex | be15e9bdb |
51025714139 has 2 divisors, whose sum is σ = 51025714140. Its totient is φ = 51025714138.
The previous prime is 51025714111. The next prime is 51025714147. The reversal of 51025714139 is 93141752015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51025714139 - 220 = 51024665563 is a prime.
It is a super-2 number, since 2×510257141392 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (51025714109) 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, 25512857069 + 25512857070.
It is an arithmetic number, because the mean of its divisors is an integer number (25512857070).
Almost surely, 251025714139 is an apocalyptic number.
51025714139 is a deficient number, since it is larger than the sum of its proper divisors (1).
51025714139 is an equidigital number, since it uses as much as digits as its factorization.
51025714139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 38.
The spelling of 51025714139 in words is "fifty-one billion, twenty-five million, seven hundred fourteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •