Base | Representation |
---|---|
bin | 1011111010111… |
… | …1111110010000 |
3 | 10111002110101200 |
4 | 2332233332100 |
5 | 100300110411 |
6 | 4543431200 |
7 | 1145011560 |
oct | 276577620 |
9 | 114073350 |
10 | 50003856 |
11 | 26253701 |
12 | 148b5500 |
13 | a48a0a6 |
14 | 68d8da0 |
15 | 45cae56 |
hex | 2faff90 |
50003856 has 120 divisors (see below), whose sum is σ = 161715840. Its totient is φ = 14128128.
The previous prime is 50003843. The next prime is 50003873. The reversal of 50003856 is 65830005.
It is a super-2 number, since 2×500038562 = 5000771229737472, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 113685 + ... + 114123.
It is an arithmetic number, because the mean of its divisors is an integer number (1347632).
Almost surely, 250003856 is an apocalyptic number.
50003856 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 50003856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80857920).
50003856 is an abundant number, since it is smaller than the sum of its proper divisors (111711984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50003856 is a wasteful number, since it uses less digits than its factorization.
50003856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573 (or 564 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 50003856 is about 7071.3404669836. The cubic root of 50003856 is about 368.4126200376.
The spelling of 50003856 in words is "fifty million, three thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •