Base | Representation |
---|---|
bin | 100111000000… |
… | …100111110001 |
3 | 201020112122201 |
4 | 213000213301 |
5 | 10104214121 |
6 | 1003103201 |
7 | 152630611 |
oct | 47004761 |
9 | 21215581 |
10 | 10226161 |
11 | 5855080 |
12 | 3511b01 |
13 | 21707aa |
14 | 1502a41 |
15 | d6ee91 |
hex | 9c09f1 |
10226161 has 16 divisors (see below), whose sum is σ = 11874240. Its totient is φ = 8709120.
The previous prime is 10226147. The next prime is 10226221. The reversal of 10226161 is 16162201.
It is a 3-Lehmer number, since φ(10226161) divides (10226161-1)3.
It is a cyclic number.
It is not a de Polignac number, because 10226161 - 27 = 10226033 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (10226141) 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 15 ways as a sum of consecutive naturals, for example, 23401 + ... + 23833.
It is an arithmetic number, because the mean of its divisors is an integer number (742140).
It is a Poulet number, since it divides 210226160-1.
Almost surely, 210226161 is an apocalyptic number.
10226161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10226161 is a deficient number, since it is larger than the sum of its proper divisors (1648079).
10226161 is a wasteful number, since it uses less digits than its factorization.
10226161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 10226161 is about 3197.8369251730. The cubic root of 10226161 is about 217.0555401593.
Adding to 10226161 its reverse (16162201), we get a palindrome (26388362).
The spelling of 10226161 in words is "ten million, two hundred twenty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •