Base | Representation |
---|---|
bin | 101111100010110000… |
… | …000010010110010000 |
3 | 11212202200110222102121 |
4 | 233202300002112100 |
5 | 1314022003233400 |
6 | 35241310424024 |
7 | 3455016231301 |
oct | 574260022620 |
9 | 155680428377 |
10 | 51048883600 |
11 | 1a716844900 |
12 | 9a88202014 |
13 | 4a77164100 |
14 | 2683b647a8 |
15 | 14db9d021a |
hex | be2c02590 |
51048883600 has 405 divisors, whose sum is σ = 147846793059. Its totient is φ = 16918387200.
The previous prime is 51048883579. The next prime is 51048883601. The reversal of 51048883600 is 638884015.
The square root of 51048883600 is 225940.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 13157925264 + 37890958336 = 114708^2 + 194656^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51048883601) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 646188361 + ... + 646188439.
Almost surely, 251048883600 is an apocalyptic number.
51048883600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51048883600 is the 225940-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51048883600
51048883600 is an abundant number, since it is smaller than the sum of its proper divisors (96797909459).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51048883600 is a wasteful number, since it uses less digits than its factorization.
51048883600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 224 (or 110 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 43.
The spelling of 51048883600 in words is "fifty-one billion, forty-eight million, eight hundred eighty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •