Base | Representation |
---|---|
bin | 101111101110100011… |
… | …010000001110001011 |
3 | 11220021111000011211021 |
4 | 233232203100032023 |
5 | 1314423143443042 |
6 | 35313102013311 |
7 | 3462642054421 |
oct | 575643201613 |
9 | 156244004737 |
10 | 51246859147 |
11 | 1a808574860 |
12 | 9b22577237 |
13 | 4aa918cac3 |
14 | 26a217b111 |
15 | 14ee089867 |
hex | bee8d038b |
51246859147 has 32 divisors (see below), whose sum is σ = 59917190400. Its totient is φ = 43336022400.
The previous prime is 51246859141. The next prime is 51246859151. The reversal of 51246859147 is 74195864215.
It is not a de Polignac number, because 51246859147 - 231 = 49099375499 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51246859094 and 51246859103.
It is not an unprimeable number, because it can be changed into a prime (51246859141) 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, 13081233 + ... + 13085149.
It is an arithmetic number, because the mean of its divisors is an integer number (1872412200).
Almost surely, 251246859147 is an apocalyptic number.
51246859147 is a deficient number, since it is larger than the sum of its proper divisors (8670331253).
51246859147 is a wasteful number, since it uses less digits than its factorization.
51246859147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5067.
The product of its digits is 2419200, while the sum is 52.
The spelling of 51246859147 in words is "fifty-one billion, two hundred forty-six million, eight hundred fifty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •