Base | Representation |
---|---|
bin | 1100000110001… |
… | …0100000110000 |
3 | 10112110121112201 |
4 | 3001202200300 |
5 | 100442011102 |
6 | 5011232544 |
7 | 1154145616 |
oct | 301424060 |
9 | 115417481 |
10 | 50735152 |
11 | 26703086 |
12 | 14ba8754 |
13 | a684c00 |
14 | 6a496b6 |
15 | 46c2987 |
hex | 3062830 |
50735152 has 60 divisors (see below), whose sum is σ = 110283120. Its totient is φ = 22573824.
The previous prime is 50735129. The next prime is 50735207. The reversal of 50735152 is 25153705.
It is a self number, because there is not a number n which added to its sum of digits gives 50735152.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 78093 + ... + 78739.
It is an arithmetic number, because the mean of its divisors is an integer number (1838052).
Almost surely, 250735152 is an apocalyptic number.
50735152 is a gapful number since it is divisible by the number (52) 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 50735152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55141560).
50735152 is an abundant number, since it is smaller than the sum of its proper divisors (59547968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50735152 is a wasteful number, since it uses less digits than its factorization.
50735152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 710 (or 691 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 28.
The square root of 50735152 is about 7122.8612228514. The cubic root of 50735152 is about 370.1999211760.
Adding to 50735152 its reverse (25153705), we get a palindrome (75888857).
The spelling of 50735152 in words is "fifty million, seven hundred thirty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •