Base | Representation |
---|---|
bin | 1100000101000… |
… | …1101011011000 |
3 | 10112100002221221 |
4 | 3001101223120 |
5 | 100432304300 |
6 | 5005541424 |
7 | 1153440604 |
oct | 301215330 |
9 | 115302857 |
10 | 50666200 |
11 | 266662a2 |
12 | 14b74874 |
13 | a65c700 |
14 | 6a2c504 |
15 | 46ac31a |
hex | 3051ad8 |
50666200 has 72 divisors (see below), whose sum is σ = 127642500. Its totient is φ = 18695040.
The previous prime is 50666197. The next prime is 50666207. The reversal of 50666200 is 266605.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50666207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 33051 + ... + 34549.
Almost surely, 250666200 is an apocalyptic number.
50666200 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 50666200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63821250).
50666200 is an abundant number, since it is smaller than the sum of its proper divisors (76976300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50666200 is a wasteful number, since it uses less digits than its factorization.
50666200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1541 (or 1519 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 50666200 is about 7118.0193874420. The cubic root of 50666200 is about 370.0321374569.
The spelling of 50666200 in words is "fifty million, six hundred sixty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •