Base | Representation |
---|---|
bin | 1100000101100… |
… | …1100100101000 |
3 | 10112101202022120 |
4 | 3001121210220 |
5 | 100434323121 |
6 | 5010351240 |
7 | 1153634100 |
oct | 301314450 |
9 | 115352276 |
10 | 50698536 |
11 | 26688619 |
12 | 14b8b520 |
13 | a671345 |
14 | 6a3a200 |
15 | 46b6bc6 |
hex | 3059928 |
50698536 has 96 divisors (see below), whose sum is σ = 155268000. Its totient is φ = 13716864.
The previous prime is 50698511. The next prime is 50698537. The reversal of 50698536 is 63589605.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50698537) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21210 + ... + 23478.
It is an arithmetic number, because the mean of its divisors is an integer number (1617375).
Almost surely, 250698536 is an apocalyptic number.
50698536 is a gapful number since it is divisible by the number (56) 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 50698536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77634000).
50698536 is an abundant number, since it is smaller than the sum of its proper divisors (104569464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50698536 is a wasteful number, since it uses less digits than its factorization.
50698536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2311 (or 2300 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 42.
The square root of 50698536 is about 7120.2904435142. The cubic root of 50698536 is about 370.1108409094.
The spelling of 50698536 in words is "fifty million, six hundred ninety-eight thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •