Base | Representation |
---|---|
bin | 1011111101000… |
… | …1010011110000 |
3 | 10111100101200212 |
4 | 2333101103300 |
5 | 100313443100 |
6 | 4550403252 |
7 | 1146120632 |
oct | 277212360 |
9 | 114311625 |
10 | 50140400 |
11 | 26337252 |
12 | 14960528 |
13 | a50729b |
14 | 6932a52 |
15 | 4606635 |
hex | 2fd14f0 |
50140400 has 60 divisors (see below), whose sum is σ = 121731792. Its totient is φ = 19845120.
The previous prime is 50140397. The next prime is 50140403. The reversal of 50140400 is 404105.
It is an interprime number because it is at equal distance from previous prime (50140397) and next prime (50140403).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50140403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40592 + ... + 41808.
Almost surely, 250140400 is an apocalyptic number.
50140400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50140400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60865896).
50140400 is an abundant number, since it is smaller than the sum of its proper divisors (71591392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50140400 is a wasteful number, since it uses less digits than its factorization.
50140400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1338 (or 1327 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 14.
The square root of 50140400 is about 7080.9886315401. The cubic root of 50140400 is about 368.7476529583.
Adding to 50140400 its reverse (404105), we get a palindrome (50544505).
The spelling of 50140400 in words is "fifty million, one hundred forty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •