Base | Representation |
---|---|
bin | 1011111110110… |
… | …0110110010000 |
3 | 10111120010102122 |
4 | 2333230312100 |
5 | 100331100300 |
6 | 4553033412 |
7 | 1150100534 |
oct | 277546620 |
9 | 114503378 |
10 | 50253200 |
11 | 26403a78 |
12 | 149b5868 |
13 | a54672a |
14 | 6961bc4 |
15 | 4629c85 |
hex | 2fecd90 |
50253200 has 60 divisors (see below), whose sum is σ = 122458308. Its totient is φ = 19814400.
The previous prime is 50253193. The next prime is 50253277. The reversal of 50253200 is 235205.
It can be written as a sum of positive squares in 6 ways, for example, as 13456 + 50239744 = 116^2 + 7088^2 .
It is a super-2 number, since 2×502532002 = 5050768220480000, which contains 22 as substring.
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, 28340 + ... + 30060.
Almost surely, 250253200 is an apocalyptic number.
50253200 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 50253200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61229154).
50253200 is an abundant number, since it is smaller than the sum of its proper divisors (72205108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50253200 is a wasteful number, since it uses less digits than its factorization.
50253200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1812 (or 1801 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 17.
The square root of 50253200 is about 7088.9491463827. The cubic root of 50253200 is about 369.0239676169.
Adding to 50253200 its reverse (235205), we get a palindrome (50488405).
The spelling of 50253200 in words is "fifty million, two hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •