Base | Representation |
---|---|
bin | 10011001100011… |
… | …00001010010001 |
3 | 102012221222000112 |
4 | 21212030022101 |
5 | 312204144400 |
6 | 23550531105 |
7 | 3663346622 |
oct | 1146141221 |
9 | 365858015 |
10 | 161006225 |
11 | 8297a3a6 |
12 | 45b06a95 |
13 | 27483773 |
14 | 17551a49 |
15 | e205835 |
hex | 998c291 |
161006225 has 6 divisors (see below), whose sum is σ = 199647750. Its totient is φ = 128804960.
The previous prime is 161006207. The next prime is 161006227. The reversal of 161006225 is 522600161.
It can be written as a sum of positive squares in 3 ways, for example, as 19324816 + 141681409 = 4396^2 + 11903^2 .
It is not a de Polignac number, because 161006225 - 28 = 161005969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161006225.
It is not an unprimeable number, because it can be changed into a prime (161006227) 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 5 ways as a sum of consecutive naturals, for example, 3220100 + ... + 3220149.
It is an arithmetic number, because the mean of its divisors is an integer number (33274625).
Almost surely, 2161006225 is an apocalyptic number.
It is an amenable number.
161006225 is a deficient number, since it is larger than the sum of its proper divisors (38641525).
161006225 is an equidigital number, since it uses as much as digits as its factorization.
161006225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6440259 (or 6440254 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 161006225 is about 12688.8228374424. The cubic root of 161006225 is about 544.0191937883.
Adding to 161006225 its reverse (522600161), we get a palindrome (683606386).
The spelling of 161006225 in words is "one hundred sixty-one million, six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •