Base | Representation |
---|---|
bin | 101111001000100111… |
… | …110001101011100001 |
3 | 11211122010121022200010 |
4 | 233020213301223201 |
5 | 1312122242314221 |
6 | 35130010515133 |
7 | 3441114145632 |
oct | 571047615341 |
9 | 154563538603 |
10 | 50610510561 |
11 | 1a51134a736 |
12 | 9985435aa9 |
13 | 4a073a8690 |
14 | 2641851889 |
15 | 14b328bc76 |
hex | bc89f1ae1 |
50610510561 has 32 divisors (see below), whose sum is σ = 73966154752. Its totient is φ = 30591509760.
The previous prime is 50610510553. The next prime is 50610510581. The reversal of 50610510561 is 16501501605.
It is not a de Polignac number, because 50610510561 - 23 = 50610510553 is a prime.
It is a super-2 number, since 2×506105105612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50610510541) 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 in 31 ways as a sum of consecutive naturals, for example, 1729296 + ... + 1758318.
It is an arithmetic number, because the mean of its divisors is an integer number (2311442336).
Almost surely, 250610510561 is an apocalyptic number.
It is an amenable number.
50610510561 is a deficient number, since it is larger than the sum of its proper divisors (23355644191).
50610510561 is a wasteful number, since it uses less digits than its factorization.
50610510561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29833.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 50610510561 in words is "fifty billion, six hundred ten million, five hundred ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •