Base | Representation |
---|---|
bin | 101111001000100111… |
… | …111101110000110011 |
3 | 11211122010200211120002 |
4 | 233020213331300303 |
5 | 1312122300410201 |
6 | 35130011540215 |
7 | 3441114443132 |
oct | 571047756063 |
9 | 154563624502 |
10 | 50610560051 |
11 | 1a511383937 |
12 | 998545a66b |
13 | 4a073c506c |
14 | 2641865919 |
15 | 14b329b76b |
hex | bc89fdc33 |
50610560051 has 2 divisors, whose sum is σ = 50610560052. Its totient is φ = 50610560050.
The previous prime is 50610559973. The next prime is 50610560057. The reversal of 50610560051 is 15006501605.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50610560051 - 214 = 50610543667 is a prime.
It is a super-2 number, since 2×506105600512 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 50610559996 and 50610560023.
It is not a weakly prime, because it can be changed into another prime (50610560057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25305280025 + 25305280026.
It is an arithmetic number, because the mean of its divisors is an integer number (25305280026).
Almost surely, 250610560051 is an apocalyptic number.
50610560051 is a deficient number, since it is larger than the sum of its proper divisors (1).
50610560051 is an equidigital number, since it uses as much as digits as its factorization.
50610560051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 50610560051 in words is "fifty billion, six hundred ten million, five hundred sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •