Base | Representation |
---|---|
bin | 101110101110011001… |
… | …000111100000000001 |
3 | 11210111110120110000011 |
4 | 232232121013200001 |
5 | 1310222114211121 |
6 | 35014211024521 |
7 | 3424161606103 |
oct | 565631074001 |
9 | 153443513004 |
10 | 50170460161 |
11 | 1a305a0a318 |
12 | 9881b9b141 |
13 | 4967183623 |
14 | 25dd223573 |
15 | 14898167e1 |
hex | bae647801 |
50170460161 has 4 divisors (see below), whose sum is σ = 50391475632. Its totient is φ = 49949444692.
The previous prime is 50170460113. The next prime is 50170460177. The reversal of 50170460161 is 16106407105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50170460161 - 29 = 50170459649 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50170460101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110507395 + ... + 110507848.
It is an arithmetic number, because the mean of its divisors is an integer number (12597868908).
Almost surely, 250170460161 is an apocalyptic number.
It is an amenable number.
50170460161 is a deficient number, since it is larger than the sum of its proper divisors (221015471).
50170460161 is a wasteful number, since it uses less digits than its factorization.
50170460161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221015470.
The product of its (nonzero) digits is 5040, while the sum is 31.
Adding to 50170460161 its reverse (16106407105), we get a palindrome (66276867266).
The spelling of 50170460161 in words is "fifty billion, one hundred seventy million, four hundred sixty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •