Base | Representation |
---|---|
bin | 1011111111100… |
… | …1101011011000 |
3 | 10111122210112000 |
4 | 2333321223120 |
5 | 100334241002 |
6 | 4554121000 |
7 | 1150410000 |
oct | 277715330 |
9 | 114583460 |
10 | 50305752 |
11 | 2643a502 |
12 | 14a20160 |
13 | a564623 |
14 | 6977000 |
15 | 463a61c |
hex | 2ff9ad8 |
50305752 has 160 divisors (see below), whose sum is σ = 164698800. Its totient is φ = 14224896.
The previous prime is 50305747. The next prime is 50305753. The reversal of 50305752 is 25750305.
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 (50305753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 518568 + ... + 518664.
Almost surely, 250305752 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 50305752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82349400).
50305752 is an abundant number, since it is smaller than the sum of its proper divisors (114393048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50305752 is an equidigital number, since it uses as much as digits as its factorization.
50305752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 27.
The square root of 50305752 is about 7092.6547921071. The cubic root of 50305752 is about 369.1525577130.
The spelling of 50305752 in words is "fifty million, three hundred five thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •