Base | Representation |
---|---|
bin | 1100001001100… |
… | …0100110011100 |
3 | 10112212212110012 |
4 | 3002120212130 |
5 | 101021103300 |
6 | 5020102352 |
7 | 1156060544 |
oct | 302304634 |
9 | 115785405 |
10 | 50956700 |
11 | 26844583 |
12 | 150949b8 |
13 | a7319c2 |
14 | 6aa6324 |
15 | 4718435 |
hex | 309899c |
50956700 has 36 divisors (see below), whose sum is σ = 112149072. Its totient is φ = 20092800.
The previous prime is 50956693. The next prime is 50956709. The reversal of 50956700 is 765905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50956709) 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 11 ways as a sum of consecutive naturals, for example, 3512 + ... + 10688.
It is an arithmetic number, because the mean of its divisors is an integer number (3115252).
Almost surely, 250956700 is an apocalyptic number.
50956700 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 50956700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56074536).
50956700 is an abundant number, since it is smaller than the sum of its proper divisors (61192372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50956700 is a wasteful number, since it uses less digits than its factorization.
50956700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7262 (or 7255 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 32.
The square root of 50956700 is about 7138.3961784143. The cubic root of 50956700 is about 370.7379962245.
The spelling of 50956700 in words is "fifty million, nine hundred fifty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •