Base | Representation |
---|---|
bin | 1100000100111… |
… | …0000111110000 |
3 | 10112022100222101 |
4 | 3001032013300 |
5 | 100431323012 |
6 | 5005350144 |
7 | 1153350253 |
oct | 301160760 |
9 | 115270871 |
10 | 50651632 |
11 | 26656359 |
12 | 14b68354 |
13 | a655ba5 |
14 | 6a2709a |
15 | 46a7d57 |
hex | 304e1f0 |
50651632 has 40 divisors (see below), whose sum is σ = 102270240. Its totient is φ = 24272640.
The previous prime is 50651621. The next prime is 50651633. The reversal of 50651632 is 23615605.
It is a self number, because there is not a number n which added to its sum of digits gives 50651632.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50651633) 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, 79957 + ... + 80587.
It is an arithmetic number, because the mean of its divisors is an integer number (2556756).
Almost surely, 250651632 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 50651632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51135120).
50651632 is an abundant number, since it is smaller than the sum of its proper divisors (51618608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50651632 is a wasteful number, since it uses less digits than its factorization.
50651632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841 (or 835 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 50651632 is about 7116.9959955026. The cubic root of 50651632 is about 369.9966690715.
The spelling of 50651632 in words is "fifty million, six hundred fifty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •