Base | Representation |
---|---|
bin | 101111100010111110… |
… | …111011011101110000 |
3 | 11212202221211022200000 |
4 | 233202332323131300 |
5 | 1314024003200233 |
6 | 35241530230000 |
7 | 3455064351156 |
oct | 574276733560 |
9 | 155687738600 |
10 | 51052787568 |
11 | 1a718a70a22 |
12 | 9a89585300 |
13 | 4a77c00053 |
14 | 268449d3d6 |
15 | 14dc001d13 |
hex | be2fbb770 |
51052787568 has 240 divisors, whose sum is σ = 156936788736. Its totient is φ = 16032867840.
The previous prime is 51052787563. The next prime is 51052787609. The reversal of 51052787568 is 86578725015.
51052787568 is a `hidden beast` number, since 5 + 1 + 0 + 5 + 2 + 78 + 7 + 568 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51052787563) 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 47 ways as a sum of consecutive naturals, for example, 5987148 + ... + 5995668.
Almost surely, 251052787568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51052787568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78468394368).
51052787568 is an abundant number, since it is smaller than the sum of its proper divisors (105884001168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51052787568 is a wasteful number, since it uses less digits than its factorization.
51052787568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8634 (or 8616 counting only the distinct ones).
The product of its (nonzero) digits is 4704000, while the sum is 54.
The spelling of 51052787568 in words is "fifty-one billion, fifty-two million, seven hundred eighty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •