Base | Representation |
---|---|
bin | 1100001001010… |
… | …0011101110000 |
3 | 10112212000012210 |
4 | 3002110131300 |
5 | 101020033020 |
6 | 5015452120 |
7 | 1155660264 |
oct | 302243560 |
9 | 115760183 |
10 | 50939760 |
11 | 26832883 |
12 | 15087040 |
13 | a727091 |
14 | 6aa00a4 |
15 | 47133e0 |
hex | 3094770 |
50939760 has 80 divisors (see below), whose sum is σ = 166239360. Its totient is φ = 12867840.
The previous prime is 50939729. The next prime is 50939761. The reversal of 50939760 is 6793905.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50939761) 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 15 ways as a sum of consecutive naturals, for example, 1026 + ... + 10145.
It is an arithmetic number, because the mean of its divisors is an integer number (2077992).
Almost surely, 250939760 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 50939760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83119680).
50939760 is an abundant number, since it is smaller than the sum of its proper divisors (115299600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50939760 is a wasteful number, since it uses less digits than its factorization.
50939760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11206 (or 11200 counting only the distinct ones).
The product of its (nonzero) digits is 51030, while the sum is 39.
The square root of 50939760 is about 7137.2095387483. The cubic root of 50939760 is about 370.6969090680.
The spelling of 50939760 in words is "fifty million, nine hundred thirty-nine thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •