Base | Representation |
---|---|
bin | 1011111110111… |
… | …0010001101101 |
3 | 10111120102110102 |
4 | 2333232101231 |
5 | 100331242203 |
6 | 4553120445 |
7 | 1150123565 |
oct | 277562155 |
9 | 114512412 |
10 | 50259053 |
11 | 26408409 |
12 | 149b9125 |
13 | a5492b0 |
14 | 6963da5 |
15 | 462b888 |
hex | 2fee46d |
50259053 has 4 divisors (see below), whose sum is σ = 54125148. Its totient is φ = 46392960.
The previous prime is 50259049. The next prime is 50259103. The reversal of 50259053 is 35095205.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35095205 = 5 ⋅7019041.
It can be written as a sum of positive squares in 2 ways, for example, as 9132484 + 41126569 = 3022^2 + 6413^2 .
It is a cyclic number.
It is not a de Polignac number, because 50259053 - 22 = 50259049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50259043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1933028 + ... + 1933053.
It is an arithmetic number, because the mean of its divisors is an integer number (13531287).
Almost surely, 250259053 is an apocalyptic number.
It is an amenable number.
50259053 is a deficient number, since it is larger than the sum of its proper divisors (3866095).
50259053 is a wasteful number, since it uses less digits than its factorization.
50259053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3866094.
The product of its (nonzero) digits is 6750, while the sum is 29.
The square root of 50259053 is about 7089.3619600074. The cubic root of 50259053 is about 369.0382938253.
The spelling of 50259053 in words is "fifty million, two hundred fifty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •