Base | Representation |
---|---|
bin | 101110101110011010… |
… | …001100010100101101 |
3 | 11210111111002202200220 |
4 | 232232122030110231 |
5 | 1310222202221221 |
6 | 35014221041553 |
7 | 3424164162006 |
oct | 565632142455 |
9 | 153444082626 |
10 | 50170742061 |
11 | 1a3060920a0 |
12 | 98820b62b9 |
13 | 4967251a2b |
14 | 25dd2981ad |
15 | 14898700c6 |
hex | bae68c52d |
50170742061 has 8 divisors (see below), whose sum is σ = 72975624864. Its totient is φ = 30406510320.
The previous prime is 50170741937. The next prime is 50170742101. The reversal of 50170742061 is 16024707105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50170742061 - 29 = 50170741549 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1520325517 = 50170742061 / (5 + 0 + 1 + 7 + 0 + 7 + 4 + 2 + 0 + 6 + 1).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50170742161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 760162726 + ... + 760162791.
It is an arithmetic number, because the mean of its divisors is an integer number (9121953108).
Almost surely, 250170742061 is an apocalyptic number.
It is an amenable number.
50170742061 is a deficient number, since it is larger than the sum of its proper divisors (22804882803).
50170742061 is a wasteful number, since it uses less digits than its factorization.
50170742061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1520325531.
The product of its (nonzero) digits is 11760, while the sum is 33.
The spelling of 50170742061 in words is "fifty billion, one hundred seventy million, seven hundred forty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •