Base | Representation |
---|---|
bin | 110000000110100000… |
… | …111101001011100010 |
3 | 11221022111112110222110 |
4 | 300012200331023202 |
5 | 1321234110110200 |
6 | 35421023220150 |
7 | 3505623330453 |
oct | 600640751342 |
9 | 157274473873 |
10 | 51648910050 |
11 | 1a9a4510631 |
12 | a015147656 |
13 | 4b4156ba4a |
14 | 26dd71712a |
15 | 1524505b50 |
hex | c0683d2e2 |
51648910050 has 48 divisors (see below), whose sum is σ = 128599706592. Its totient is φ = 13718160000.
The previous prime is 51648910021. The next prime is 51648910051. The reversal of 51648910050 is 5001984615.
It is a super-3 number, since 3×516489100503 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51648909990 and 51648910008.
It is not an unprimeable number, because it can be changed into a prime (51648910051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 648259 + ... + 723558.
It is an arithmetic number, because the mean of its divisors is an integer number (2679160554).
Almost surely, 251648910050 is an apocalyptic number.
51648910050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51648910050 is an abundant number, since it is smaller than the sum of its proper divisors (76950796542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51648910050 is a wasteful number, since it uses less digits than its factorization.
51648910050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1372083 (or 1372078 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 39.
The spelling of 51648910050 in words is "fifty-one billion, six hundred forty-eight million, nine hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •