Base | Representation |
---|---|
bin | 1011111100001… |
… | …1000011101110 |
3 | 10111020102122000 |
4 | 2333003003232 |
5 | 100310111110 |
6 | 4545233130 |
7 | 1145455515 |
oct | 277030356 |
9 | 114212560 |
10 | 50082030 |
11 | 262a7409 |
12 | 149327a6 |
13 | a4b684b |
14 | 691967c |
15 | 45e41c0 |
hex | 2fc30ee |
50082030 has 64 divisors (see below), whose sum is σ = 134265600. Its totient is φ = 13284000.
The previous prime is 50082013. The next prime is 50082047. The reversal of 50082030 is 3028005.
It is an interprime number because it is at equal distance from previous prime (50082013) and next prime (50082047).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50081994 and 50082012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67401 + ... + 68139.
It is an arithmetic number, because the mean of its divisors is an integer number (2097900).
Almost surely, 250082030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50082030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67132800).
50082030 is an abundant number, since it is smaller than the sum of its proper divisors (84183570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50082030 is a wasteful number, since it uses less digits than its factorization.
50082030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006 (or 1000 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 50082030 is about 7076.8658317083. The cubic root of 50082030 is about 368.6045071911.
The spelling of 50082030 in words is "fifty million, eighty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •