Base | Representation |
---|---|
bin | 1100010111011… |
… | …1000110000000 |
3 | 10121121011120020 |
4 | 3011313012000 |
5 | 101234234112 |
6 | 5051413440 |
7 | 1166604516 |
oct | 305670600 |
9 | 117534506 |
10 | 51868032 |
11 | 27307247 |
12 | 15454280 |
13 | a990758 |
14 | 6c624b6 |
15 | 484848c |
hex | 3177180 |
51868032 has 64 divisors (see below), whose sum is σ = 138544560. Its totient is φ = 17192960.
The previous prime is 51868027. The next prime is 51868039. The reversal of 51868032 is 23086815.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 51867984 and 51868002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51868039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112282 + ... + 112742.
Almost surely, 251868032 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 51868032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69272280).
51868032 is an abundant number, since it is smaller than the sum of its proper divisors (86676528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51868032 is a wasteful number, since it uses less digits than its factorization.
51868032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771 (or 759 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 51868032 is about 7201.9464035773. The cubic root of 51868032 is about 372.9350968923.
The spelling of 51868032 in words is "fifty-one million, eight hundred sixty-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •