Base | Representation |
---|---|
bin | 110000001000011000… |
… | …100100001010000000 |
3 | 11221101200112110122200 |
4 | 300020120210022000 |
5 | 1321320121433312 |
6 | 35424103233200 |
7 | 3506454001020 |
oct | 601030441200 |
9 | 157350473580 |
10 | 51680264832 |
11 | 1aa10186979 |
12 | a023748800 |
13 | 4b47bc9581 |
14 | 2703959a80 |
15 | 152714b0dc |
hex | c08624280 |
51680264832 has 384 divisors, whose sum is σ = 175722792960. Its totient is φ = 14272505856.
The previous prime is 51680264807. The next prime is 51680264833. The reversal of 51680264832 is 23846208615.
51680264832 is a `hidden beast` number, since 5 + 168 + 0 + 2 + 6 + 483 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (384).
It is not an unprimeable number, because it can be changed into a prime (51680264833) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35714733 + ... + 35716179.
It is an arithmetic number, because the mean of its divisors is an integer number (457611440).
Almost surely, 251680264832 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 51680264832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87861396480).
51680264832 is an abundant number, since it is smaller than the sum of its proper divisors (124042528128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51680264832 is a wasteful number, since it uses less digits than its factorization.
51680264832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620 (or 1605 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 51680264832 in words is "fifty-one billion, six hundred eighty million, two hundred sixty-four thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •