Base | Representation |
---|---|
bin | 1100000000001… |
… | …1110011011000 |
3 | 10111201220102000 |
4 | 3000003303120 |
5 | 100342102344 |
6 | 4555041000 |
7 | 1150641624 |
oct | 300036330 |
9 | 114656360 |
10 | 50347224 |
11 | 26468684 |
12 | 14a40160 |
13 | a57a475 |
14 | 6988184 |
15 | 4647a69 |
hex | 3003cd8 |
50347224 has 128 divisors (see below), whose sum is σ = 147763200. Its totient is φ = 15863040.
The previous prime is 50347223. The next prime is 50347229. The reversal of 50347224 is 42274305.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50347223) 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, 488757 + ... + 488859.
It is an arithmetic number, because the mean of its divisors is an integer number (1154400).
Almost surely, 250347224 is an apocalyptic number.
50347224 is a gapful number since it is divisible by the number (54) 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 50347224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73881600).
50347224 is an abundant number, since it is smaller than the sum of its proper divisors (97415976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50347224 is a wasteful number, since it uses less digits than its factorization.
50347224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222 (or 212 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 27.
The square root of 50347224 is about 7095.5777777430. The cubic root of 50347224 is about 369.2539728206.
The spelling of 50347224 in words is "fifty million, three hundred forty-seven thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •