Base | Representation |
---|---|
bin | 101111101011110000… |
… | …010111011001011111 |
3 | 11220011012202200211101 |
4 | 233223300113121133 |
5 | 1314324142333032 |
6 | 35304304533531 |
7 | 3461532343210 |
oct | 575360273137 |
9 | 156135680741 |
10 | 51199964767 |
11 | 1a794055376 |
12 | 9b0a9212a7 |
13 | 4a9c551153 |
14 | 2699c51407 |
15 | 14e9dc4de7 |
hex | bebc1765f |
51199964767 has 24 divisors (see below), whose sum is σ = 60194167200. Its totient is φ = 42655312128.
The previous prime is 51199964759. The next prime is 51199964779. The reversal of 51199964767 is 76746999115.
It is not a de Polignac number, because 51199964767 - 23 = 51199964759 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51199964699 and 51199964708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51199964737) 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 23 ways as a sum of consecutive naturals, for example, 2156859 + ... + 2180467.
It is an arithmetic number, because the mean of its divisors is an integer number (2508090300).
Almost surely, 251199964767 is an apocalyptic number.
51199964767 is a deficient number, since it is larger than the sum of its proper divisors (8994202433).
51199964767 is an equidigital number, since it uses as much as digits as its factorization.
51199964767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23823 (or 23764 counting only the distinct ones).
The product of its digits is 25719120, while the sum is 64.
The spelling of 51199964767 in words is "fifty-one billion, one hundred ninety-nine million, nine hundred sixty-four thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •