Base | Representation |
---|---|
bin | 10011001100101… |
… | …10111111101001 |
3 | 102020001012220002 |
4 | 21212112333221 |
5 | 312212104401 |
6 | 23551512345 |
7 | 3663623165 |
oct | 1146267751 |
9 | 366035802 |
10 | 161050601 |
11 | 829aa778 |
12 | 45b286b5 |
13 | 2749aa1a |
14 | 17563ca5 |
15 | e213a6b |
hex | 9996fe9 |
161050601 has 4 divisors (see below), whose sum is σ = 166604100. Its totient is φ = 155497104.
The previous prime is 161050597. The next prime is 161050607. The reversal of 161050601 is 106050161.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 89208025 + 71842576 = 9445^2 + 8476^2 .
It is a cyclic number.
It is not a de Polignac number, because 161050601 - 22 = 161050597 is a prime.
It is a super-2 number, since 2×1610506012 = 51874592164922402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161050607) 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 3 ways as a sum of consecutive naturals, for example, 2776706 + ... + 2776763.
It is an arithmetic number, because the mean of its divisors is an integer number (41651025).
Almost surely, 2161050601 is an apocalyptic number.
It is an amenable number.
161050601 is a deficient number, since it is larger than the sum of its proper divisors (5553499).
161050601 is an equidigital number, since it uses as much as digits as its factorization.
161050601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5553498.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 161050601 is about 12690.5713425362. The cubic root of 161050601 is about 544.0691694505.
The spelling of 161050601 in words is "one hundred sixty-one million, fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •