Base | Representation |
---|---|
bin | 1100000100001… |
… | …0111111100101 |
3 | 10112020001110021 |
4 | 3001002333211 |
5 | 100423343203 |
6 | 5004355141 |
7 | 1153100341 |
oct | 301027745 |
9 | 115201407 |
10 | 50606053 |
11 | 26625093 |
12 | 14b45ab1 |
13 | a63b214 |
14 | 6a14621 |
15 | 46995bd |
hex | 3042fe5 |
50606053 has 4 divisors (see below), whose sum is σ = 50636160. Its totient is φ = 50575948.
The previous prime is 50606051. The next prime is 50606107. The reversal of 50606053 is 35060605.
50606053 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 Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50606053 - 21 = 50606051 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 (50606051) 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, 12373 + ... + 15946.
It is an arithmetic number, because the mean of its divisors is an integer number (12659040).
Almost surely, 250606053 is an apocalyptic number.
It is an amenable number.
50606053 is a deficient number, since it is larger than the sum of its proper divisors (30107).
50606053 is a wasteful number, since it uses less digits than its factorization.
50606053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30106.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 50606053 is about 7113.7931513364. The cubic root of 50606053 is about 369.8856549512.
Adding to 50606053 its reverse (35060605), we get a palindrome (85666658).
The spelling of 50606053 in words is "fifty million, six hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •