Base | Representation |
---|---|
bin | 1100000011101… |
… | …1011100000000 |
3 | 10112011111000000 |
4 | 3000323130000 |
5 | 100421400404 |
6 | 5004000000 |
7 | 1152611166 |
oct | 300733400 |
9 | 115144000 |
10 | 50575104 |
11 | 26603908 |
12 | 14b30000 |
13 | a62a0c8 |
14 | 6a07236 |
15 | 4690339 |
hex | 303b700 |
50575104 has 126 divisors (see below), whose sum is σ = 151918256. Its totient is φ = 16796160.
The previous prime is 50575103. The next prime is 50575117. The reversal of 50575104 is 40157505.
It is a super-2 number, since 2×505751042 = 5115682289221632, which contains 22 as substring.
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 (50575103) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 186489 + ... + 186759.
Almost surely, 250575104 is an apocalyptic number.
50575104 is a gapful number since it is divisible by the number (54) 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 50575104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75959128).
50575104 is an abundant number, since it is smaller than the sum of its proper divisors (101343152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50575104 is an frugal number, since it uses more digits than its factorization.
50575104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305 (or 276 counting only the distinct ones).
The product of its (nonzero) digits is 3500, while the sum is 27.
The square root of 50575104 is about 7111.6175375227. The cubic root of 50575104 is about 369.8102362684.
The spelling of 50575104 in words is "fifty million, five hundred seventy-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •