Base | Representation |
---|---|
bin | 101111001000100111… |
… | …110000010101011011 |
3 | 11211122010121001010001 |
4 | 233020213300111123 |
5 | 1312122242130201 |
6 | 35130010433431 |
7 | 3441114123601 |
oct | 571047602533 |
9 | 154563531101 |
10 | 50610505051 |
11 | 1a511346587 |
12 | 9985432877 |
13 | 4a073a6012 |
14 | 264184d871 |
15 | 14b328a301 |
hex | bc89f055b |
50610505051 has 2 divisors, whose sum is σ = 50610505052. Its totient is φ = 50610505050.
The previous prime is 50610505037. The next prime is 50610505087. The reversal of 50610505051 is 15050501605.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50610505051 is a prime.
It is a super-2 number, since 2×506105050512 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50610505021) 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, 25305252525 + 25305252526.
It is an arithmetic number, because the mean of its divisors is an integer number (25305252526).
Almost surely, 250610505051 is an apocalyptic number.
50610505051 is a deficient number, since it is larger than the sum of its proper divisors (1).
50610505051 is an equidigital number, since it uses as much as digits as its factorization.
50610505051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 50610505051 in words is "fifty billion, six hundred ten million, five hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •