Base | Representation |
---|---|
bin | 1100000011010… |
… | …1110011000000 |
3 | 10112010022022022 |
4 | 3000311303000 |
5 | 100420131000 |
6 | 5003301012 |
7 | 1152453632 |
oct | 300656300 |
9 | 115108268 |
10 | 50552000 |
11 | 26598514 |
12 | 14b1a768 |
13 | a61c735 |
14 | 69dca52 |
15 | 4688585 |
hex | 3035cc0 |
50552000 has 112 divisors (see below), whose sum is σ = 128381760. Its totient is φ = 19712000.
The previous prime is 50551987. The next prime is 50552009. The reversal of 50552000 is 25505.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 50552000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50552009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 567956 + ... + 568044.
Almost surely, 250552000 is an apocalyptic number.
50552000 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 50552000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64190880).
50552000 is an abundant number, since it is smaller than the sum of its proper divisors (77829760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50552000 is an equidigital number, since it uses as much as digits as its factorization.
50552000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187 (or 167 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 17.
The square root of 50552000 is about 7109.9929676477. The cubic root of 50552000 is about 369.7539147689.
Adding to 50552000 its reverse (25505), we get a palindrome (50577505).
The spelling of 50552000 in words is "fifty million, five hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •