Base | Representation |
---|---|
bin | 1100000011101… |
… | …1101110000000 |
3 | 10112011112120200 |
4 | 3000323232000 |
5 | 100421420011 |
6 | 5004005200 |
7 | 1152614433 |
oct | 300735600 |
9 | 115145520 |
10 | 50576256 |
11 | 26604765 |
12 | 14b30800 |
13 | a62a7a3 |
14 | 6a0781a |
15 | 4690856 |
hex | 303bb80 |
50576256 has 96 divisors (see below), whose sum is σ = 149068920. Its totient is φ = 16450560.
The previous prime is 50576243. The next prime is 50576263. The reversal of 50576256 is 65267505.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 50576256.
It is a congruent number.
It is an unprimeable number.
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, 49026 + ... + 50046.
Almost surely, 250576256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50576256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74534460).
50576256 is an abundant number, since it is smaller than the sum of its proper divisors (98492664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50576256 is a wasteful number, since it uses less digits than its factorization.
50576256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084 (or 1069 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 50576256 is about 7111.6985312934. The cubic root of 50576256 is about 369.8130440936.
The spelling of 50576256 in words is "fifty million, five hundred seventy-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •