Base | Representation |
---|---|
bin | 1100000101011… |
… | …1011010100101 |
3 | 10112101022012100 |
4 | 3001113122211 |
5 | 100434032301 |
6 | 5010242313 |
7 | 1153566246 |
oct | 301273245 |
9 | 115338170 |
10 | 50689701 |
11 | 26681a17 |
12 | 14b86399 |
13 | a66a30a |
14 | 6a36ccd |
15 | 46b4286 |
hex | 30576a5 |
50689701 has 24 divisors (see below), whose sum is σ = 77444640. Its totient is φ = 31860000.
The previous prime is 50689679. The next prime is 50689711. The reversal of 50689701 is 10798605.
50689701 is a `hidden beast` number, since 506 + 89 + 70 + 1 = 666.
50689701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50689701 - 214 = 50673317 is a prime.
It is a super-3 number, since 3×506897013 (a number of 24 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50689711) 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 23 ways as a sum of consecutive naturals, for example, 42331 + ... + 43511.
It is an arithmetic number, because the mean of its divisors is an integer number (3226860).
Almost surely, 250689701 is an apocalyptic number.
It is an amenable number.
50689701 is a deficient number, since it is larger than the sum of its proper divisors (26754939).
50689701 is a wasteful number, since it uses less digits than its factorization.
50689701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457 (or 1454 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 50689701 is about 7119.6700063978. The cubic root of 50689701 is about 370.0893404908.
The spelling of 50689701 in words is "fifty million, six hundred eighty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •