Base | Representation |
---|---|
bin | 1100000010010… |
… | …1110011101101 |
3 | 10111222222110201 |
4 | 3000211303231 |
5 | 100411032014 |
6 | 5002033501 |
7 | 1152061663 |
oct | 300456355 |
9 | 114888421 |
10 | 50486509 |
11 | 26553297 |
12 | 14aa8891 |
13 | a5c8998 |
14 | 69c2c33 |
15 | 4673e74 |
hex | 3025ced |
50486509 has 4 divisors (see below), whose sum is σ = 50502204. Its totient is φ = 50470816.
The previous prime is 50486503. The next prime is 50486521. The reversal of 50486509 is 90568405.
50486509 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17825284 + 32661225 = 4222^2 + 5715^2 .
It is a cyclic number.
It is not a de Polignac number, because 50486509 - 225 = 16932077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50486503) 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 3 ways as a sum of consecutive naturals, for example, 1072 + ... + 10105.
It is an arithmetic number, because the mean of its divisors is an integer number (12625551).
Almost surely, 250486509 is an apocalyptic number.
It is an amenable number.
50486509 is a deficient number, since it is larger than the sum of its proper divisors (15695).
50486509 is a wasteful number, since it uses less digits than its factorization.
50486509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15694.
The product of its (nonzero) digits is 43200, while the sum is 37.
The square root of 50486509 is about 7105.3859149240. The cubic root of 50486509 is about 369.5941715448.
The spelling of 50486509 in words is "fifty million, four hundred eighty-six thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •