Base | Representation |
---|---|
bin | 1011111100010… |
… | …1111011100101 |
3 | 10111021000202211 |
4 | 2333011323211 |
5 | 100311000142 |
6 | 4545403421 |
7 | 1145535025 |
oct | 277057345 |
9 | 114230684 |
10 | 50093797 |
11 | 26305236 |
12 | 14939571 |
13 | a4bc000 |
14 | 691da85 |
15 | 45e7917 |
hex | 2fc5ee5 |
50093797 has 12 divisors (see below), whose sum is σ = 54628140. Its totient is φ = 45934200.
The previous prime is 50093777. The next prime is 50093801. The reversal of 50093797 is 79739005.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 1846881 + 48246916 = 1359^2 + 6946^2 .
It is a de Polignac number, because none of the positive numbers 2k-50093797 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 (50093717) 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 11 ways as a sum of consecutive naturals, for example, 331672 + ... + 331822.
It is an arithmetic number, because the mean of its divisors is an integer number (4552345).
Almost surely, 250093797 is an apocalyptic number.
It is an amenable number.
50093797 is a deficient number, since it is larger than the sum of its proper divisors (4534343).
50093797 is an frugal number, since it uses more digits than its factorization.
50093797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341 (or 164 counting only the distinct ones).
The product of its (nonzero) digits is 59535, while the sum is 40.
The square root of 50093797 is about 7077.6971537358. The cubic root of 50093797 is about 368.6333733638.
The spelling of 50093797 in words is "fifty million, ninety-three thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •