Base | Representation |
---|---|
bin | 101111111111110101… |
… | …110100000101100000 |
3 | 11221000200211200021000 |
4 | 233333311310011200 |
5 | 1321021423443222 |
6 | 35401543232000 |
7 | 3503063511360 |
oct | 577765640540 |
9 | 157020750230 |
10 | 51536937312 |
11 | 1a947291883 |
12 | 9ba3748600 |
13 | 4b242c57a3 |
14 | 26cc8ca9a0 |
15 | 15197889ac |
hex | bffd74160 |
51536937312 has 384 divisors, whose sum is σ = 174492057600. Its totient is φ = 14495459328.
The previous prime is 51536937281. The next prime is 51536937313. The reversal of 51536937312 is 21373963515.
51536937312 is a `hidden beast` number, since 51 + 536 + 9 + 37 + 31 + 2 = 666.
Its product of digits (510300) is a multiple of the sum of its prime factors (675).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51536937313) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 175893838 + ... + 175894130.
It is an arithmetic number, because the mean of its divisors is an integer number (454406400).
Almost surely, 251536937312 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 51536937312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87246028800).
51536937312 is an abundant number, since it is smaller than the sum of its proper divisors (122955120288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51536937312 is a wasteful number, since it uses less digits than its factorization.
51536937312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675 (or 661 counting only the distinct ones).
The product of its digits is 510300, while the sum is 45.
The spelling of 51536937312 in words is "fifty-one billion, five hundred thirty-six million, nine hundred thirty-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •