Base | Representation |
---|---|
bin | 1011111011011… |
… | …0000010111100 |
3 | 10111010201112000 |
4 | 2332312002330 |
5 | 100301404412 |
6 | 4544142300 |
7 | 1145144235 |
oct | 276660274 |
9 | 114121460 |
10 | 50028732 |
11 | 26270366 |
12 | 14907990 |
13 | a498500 |
14 | 690408c |
15 | 45d34dc |
hex | 2fb60bc |
50028732 has 72 divisors (see below), whose sum is σ = 140500080. Its totient is φ = 15387840.
The previous prime is 50028721. The next prime is 50028751. The reversal of 50028732 is 23782005.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50028696 and 50028705.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16882 + ... + 19622.
It is an arithmetic number, because the mean of its divisors is an integer number (1951390).
Almost surely, 250028732 is an apocalyptic number.
50028732 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 50028732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70250040).
50028732 is an abundant number, since it is smaller than the sum of its proper divisors (90471348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50028732 is a wasteful number, since it uses less digits than its factorization.
50028732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780 (or 2759 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 50028732 is about 7073.0991792848. The cubic root of 50028732 is about 368.4737027469.
The spelling of 50028732 in words is "fifty million, twenty-eight thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •