Base | Representation |
---|---|
bin | 1100000011001… |
… | …0110011011011 |
3 | 10112002200111012 |
4 | 3000302303123 |
5 | 100414232424 |
6 | 5003124135 |
7 | 1152403115 |
oct | 300626333 |
9 | 115080435 |
10 | 50539739 |
11 | 2658a288 |
12 | 14b1364b |
13 | a616c93 |
14 | 69d83b5 |
15 | 4684b0e |
hex | 3032cdb |
50539739 has 4 divisors (see below), whose sum is σ = 50554056. Its totient is φ = 50525424.
The previous prime is 50539673. The next prime is 50539747. The reversal of 50539739 is 93793505.
50539739 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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 50539739 - 28 = 50539483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50539696 and 50539705.
It is not an unprimeable number, because it can be changed into a prime (50539789) 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, 2327 + ... + 10319.
It is an arithmetic number, because the mean of its divisors is an integer number (12638514).
Almost surely, 250539739 is an apocalyptic number.
50539739 is a deficient number, since it is larger than the sum of its proper divisors (14317).
50539739 is an equidigital number, since it uses as much as digits as its factorization.
50539739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14316.
The product of its (nonzero) digits is 127575, while the sum is 41.
The square root of 50539739 is about 7109.1306782194. The cubic root of 50539739 is about 369.7240186928.
The spelling of 50539739 in words is "fifty million, five hundred thirty-nine thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •