Base | Representation |
---|---|
bin | 1100000110100… |
… | …0100110000111 |
3 | 10112111212201122 |
4 | 3001220212013 |
5 | 100443310241 |
6 | 5011544155 |
7 | 1154311355 |
oct | 301504607 |
9 | 115455648 |
10 | 50760071 |
11 | 2671a87a |
12 | 14bbb05b |
13 | a69335b |
14 | 6a547d5 |
15 | 46ca04b |
hex | 3068987 |
50760071 has 8 divisors (see below), whose sum is σ = 51656064. Its totient is φ = 49868280.
The previous prime is 50760053. The next prime is 50760089. The reversal of 50760071 is 17006705.
It is an interprime number because it is at equal distance from previous prime (50760053) and next prime (50760089).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50760071 - 218 = 50497927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50760071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50760271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32126 + ... + 33668.
It is an arithmetic number, because the mean of its divisors is an integer number (6457008).
Almost surely, 250760071 is an apocalyptic number.
50760071 is a deficient number, since it is larger than the sum of its proper divisors (895993).
50760071 is a wasteful number, since it uses less digits than its factorization.
50760071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101.
The product of its (nonzero) digits is 1470, while the sum is 26.
The square root of 50760071 is about 7124.6102349532. The cubic root of 50760071 is about 370.2605201991.
Adding to 50760071 its reverse (17006705), we get a palindrome (67766776).
The spelling of 50760071 in words is "fifty million, seven hundred sixty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •