Base | Representation |
---|---|
bin | 1011111110010… |
… | …0101000110000 |
3 | 10111111102022000 |
4 | 2333210220300 |
5 | 100324011233 |
6 | 4552214000 |
7 | 1146600510 |
oct | 277445060 |
9 | 114442260 |
10 | 50219568 |
11 | 26390783 |
12 | 1499a300 |
13 | a534329 |
14 | 6953840 |
15 | 461ed13 |
hex | 2fe4a30 |
50219568 has 80 divisors (see below), whose sum is σ = 164751360. Its totient is φ = 14347584.
The previous prime is 50219551. The next prime is 50219569. The reversal of 50219568 is 86591205.
It is a happy number.
50219568 is a `hidden beast` number, since 502 + 1 + 95 + 68 = 666.
50219568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (50219569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5280 + ... + 11327.
It is an arithmetic number, because the mean of its divisors is an integer number (2059392).
Almost surely, 250219568 is an apocalyptic number.
It is an amenable number.
50219568 is an abundant number, since it is smaller than the sum of its proper divisors (114531792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50219568 is a wasteful number, since it uses less digits than its factorization.
50219568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16631 (or 16619 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The square root of 50219568 is about 7086.5766065146. The cubic root of 50219568 is about 368.9416260360.
The spelling of 50219568 in words is "fifty million, two hundred nineteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •