Base | Representation |
---|---|
bin | 1100000111011… |
… | …1000110110001 |
3 | 10112121220020220 |
4 | 3001313012301 |
5 | 101002211010 |
6 | 5013123253 |
7 | 1154646552 |
oct | 301670661 |
9 | 115556226 |
10 | 50819505 |
11 | 267604a0 |
12 | 15029529 |
13 | a6b4419 |
14 | 6a6c329 |
15 | 46dc970 |
hex | 30771b1 |
50819505 has 32 divisors (see below), whose sum is σ = 89026560. Its totient is φ = 24550080.
The previous prime is 50819501. The next prime is 50819521. The reversal of 50819505 is 50591805.
50819505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50819505 - 22 = 50819501 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (50819501) 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 31 ways as a sum of consecutive naturals, for example, 78714 + ... + 79356.
It is an arithmetic number, because the mean of its divisors is an integer number (2782080).
Almost surely, 250819505 is an apocalyptic number.
50819505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50819505 is a deficient number, since it is larger than the sum of its proper divisors (38207055).
50819505 is a wasteful number, since it uses less digits than its factorization.
50819505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1141.
The product of its (nonzero) digits is 9000, while the sum is 33.
The square root of 50819505 is about 7128.7800499104. The cubic root of 50819505 is about 370.4049741638.
The spelling of 50819505 in words is "fifty million, eight hundred nineteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •