Base | Representation |
---|---|
bin | 1001011011010100… |
… | …10111111011000011 |
3 | 111001201020222111012 |
4 | 10231222113323003 |
5 | 40331112100201 |
6 | 2154111511135 |
7 | 236263133651 |
oct | 45552277303 |
9 | 14051228435 |
10 | 5061050051 |
11 | 21679158a2 |
12 | b92b284ab |
13 | 6286b5795 |
14 | 360233dd1 |
15 | 1e94b55bb |
hex | 12da97ec3 |
5061050051 has 2 divisors, whose sum is σ = 5061050052. Its totient is φ = 5061050050.
The previous prime is 5061050047. The next prime is 5061050053. The reversal of 5061050051 is 1500501605.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5061050051 - 22 = 5061050047 is a prime.
It is a super-2 number, since 2×50610500512 = 51228455237454205202, which contains 22 as substring.
Together with 5061050053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5061049999 and 5061050026.
It is not a weakly prime, because it can be changed into another prime (5061050053) 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, 2530525025 + 2530525026.
It is an arithmetic number, because the mean of its divisors is an integer number (2530525026).
Almost surely, 25061050051 is an apocalyptic number.
5061050051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5061050051 is an equidigital number, since it uses as much as digits as its factorization.
5061050051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 5061050051 is about 71141.0574211545. The cubic root of 5061050051 is about 1716.9074195579.
Adding to 5061050051 its reverse (1500501605), we get a palindrome (6561551656).
The spelling of 5061050051 in words is "five billion, sixty-one million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •