Base | Representation |
---|---|
bin | 1011111111111… |
… | …1001010001000 |
3 | 10111200221022102 |
4 | 2333333022020 |
5 | 100341000300 |
6 | 4554412532 |
7 | 1150532306 |
oct | 277771210 |
9 | 114627272 |
10 | 50328200 |
11 | 2645535a |
12 | 14a31148 |
13 | a571900 |
14 | 6981276 |
15 | 46420d5 |
hex | 2fff288 |
50328200 has 72 divisors (see below), whose sum is σ = 126791550. Its totient is φ = 18570240.
The previous prime is 50328193. The next prime is 50328203. The reversal of 50328200 is 282305.
It can be written as a sum of positive squares in 9 ways, for example, as 4169764 + 46158436 = 2042^2 + 6794^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (50328203) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 33056 + ... + 34544.
Almost surely, 250328200 is an apocalyptic number.
50328200 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 50328200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63395775).
50328200 is an abundant number, since it is smaller than the sum of its proper divisors (76463350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50328200 is a wasteful number, since it uses less digits than its factorization.
50328200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1531 (or 1509 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 50328200 is about 7094.2370978140. The cubic root of 50328200 is about 369.2074586868.
The spelling of 50328200 in words is "fifty million, three hundred twenty-eight thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •