Base | Representation |
---|---|
bin | 1100000010100… |
… | …1010110110111 |
3 | 10112000201102011 |
4 | 3000221112313 |
5 | 100412013142 |
6 | 5002225051 |
7 | 1152152242 |
oct | 300512667 |
9 | 115021364 |
10 | 50501047 |
11 | 26563203 |
12 | 14ab5187 |
13 | a60249c |
14 | 69c8259 |
15 | 4678417 |
hex | 30295b7 |
50501047 has 4 divisors (see below), whose sum is σ = 50515416. Its totient is φ = 50486680.
The previous prime is 50501029. The next prime is 50501057. The reversal of 50501047 is 74010505.
50501047 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, and also an emirpimes, since its reverse is a distinct semiprime: 74010505 = 5 ⋅14802101.
It is a cyclic number.
It is not a de Polignac number, because 50501047 - 211 = 50498999 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 (50501027) 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, 2013 + ... + 10249.
It is an arithmetic number, because the mean of its divisors is an integer number (12628854).
Almost surely, 250501047 is an apocalyptic number.
50501047 is a deficient number, since it is larger than the sum of its proper divisors (14369).
50501047 is an equidigital number, since it uses as much as digits as its factorization.
50501047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14368.
The product of its (nonzero) digits is 700, while the sum is 22.
The square root of 50501047 is about 7106.4088680571. The cubic root of 50501047 is about 369.6296440206.
The spelling of 50501047 in words is "fifty million, five hundred one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •