Base | Representation |
---|---|
bin | 101111011110001101… |
… | …111100110101010011 |
3 | 11212120101101112012020 |
4 | 233132031330311103 |
5 | 1313343021324001 |
6 | 35225552502523 |
7 | 3453103661535 |
oct | 573615746523 |
9 | 155511345166 |
10 | 50972839251 |
11 | 1a687925634 |
12 | 9a6684aa43 |
13 | 4a6448a359 |
14 | 2677a0b855 |
15 | 14d4ead736 |
hex | bde37cd53 |
50972839251 has 8 divisors (see below), whose sum is σ = 68222204160. Its totient is φ = 33852683592.
The previous prime is 50972839231. The next prime is 50972839261. The reversal of 50972839251 is 15293827905.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50972839251 - 26 = 50972839187 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 50972839194 and 50972839203.
It is not an unprimeable number, because it can be changed into a prime (50972839201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32301391 + ... + 32302968.
It is an arithmetic number, because the mean of its divisors is an integer number (8527775520).
Almost surely, 250972839251 is an apocalyptic number.
50972839251 is a deficient number, since it is larger than the sum of its proper divisors (17249364909).
50972839251 is a wasteful number, since it uses less digits than its factorization.
50972839251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64604625.
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 50972839251 in words is "fifty billion, nine hundred seventy-two million, eight hundred thirty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •