Base | Representation |
---|---|
bin | 101111011000011111… |
… | …110000010001100101 |
3 | 11212022200202102020120 |
4 | 233120133300101211 |
5 | 1313143432434414 |
6 | 35212243152153 |
7 | 3450530013441 |
oct | 573037602145 |
9 | 155280672216 |
10 | 50876843109 |
11 | 1a638719284 |
12 | 9a3a675659 |
13 | 4a4a6190c1 |
14 | 2668d7d821 |
15 | 14cb84a2a9 |
hex | bd87f0465 |
50876843109 has 8 divisors (see below), whose sum is σ = 71826131520. Its totient is φ = 31922725056.
The previous prime is 50876843107. The next prime is 50876843113. The reversal of 50876843109 is 90134867805.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50876843109 - 21 = 50876843107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51), and also a Moran number because the ratio is a prime number: 997585159 = 50876843109 / (5 + 0 + 8 + 7 + 6 + 8 + 4 + 3 + 1 + 0 + 9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50876843107) 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 7 ways as a sum of consecutive naturals, for example, 498792529 + ... + 498792630.
It is an arithmetic number, because the mean of its divisors is an integer number (8978266440).
Almost surely, 250876843109 is an apocalyptic number.
It is an amenable number.
50876843109 is a deficient number, since it is larger than the sum of its proper divisors (20949288411).
50876843109 is a wasteful number, since it uses less digits than its factorization.
50876843109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997585179.
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 50876843109 in words is "fifty billion, eight hundred seventy-six million, eight hundred forty-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •