Base | Representation |
---|---|
bin | 1100000101011… |
… | …1010011011000 |
3 | 10112101021120021 |
4 | 3001113103120 |
5 | 100434023430 |
6 | 5010240224 |
7 | 1153565020 |
oct | 301272330 |
9 | 115337507 |
10 | 50689240 |
11 | 26681638 |
12 | 14b86074 |
13 | a66a044 |
14 | 6a36a80 |
15 | 46b407a |
hex | 30574d8 |
50689240 has 128 divisors (see below), whose sum is σ = 144322560. Its totient is φ = 15611904.
The previous prime is 50689237. The next prime is 50689241. The reversal of 50689240 is 4298605.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 50689196 and 50689205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50689241) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109249 + ... + 109711.
It is an arithmetic number, because the mean of its divisors is an integer number (1127520).
Almost surely, 250689240 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 50689240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72161280).
50689240 is an abundant number, since it is smaller than the sum of its proper divisors (93633320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50689240 is a wasteful number, since it uses less digits than its factorization.
50689240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521 (or 517 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 50689240 is about 7119.6376312282. The cubic root of 50689240 is about 370.0882185555.
The spelling of 50689240 in words is "fifty million, six hundred eighty-nine thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •