Base | Representation |
---|---|
bin | 111101101010… |
… | …110100010001 |
3 | 1010102022210201 |
4 | 331222310101 |
5 | 13114304121 |
6 | 1334255201 |
7 | 254260444 |
oct | 75526421 |
9 | 33368721 |
10 | 16166161 |
11 | 9141970 |
12 | 54b7501 |
13 | 347039b |
14 | 220b65b |
15 | 1644e91 |
hex | f6ad11 |
16166161 has 8 divisors (see below), whose sum is σ = 17811648. Its totient is φ = 14550000.
The previous prime is 16166153. The next prime is 16166173.
16166161 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16166161 - 23 = 16166153 is a prime.
It is a super-2 number, since 2×161661612 = 522689522955842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16166141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6165 + ... + 8386.
It is an arithmetic number, because the mean of its divisors is an integer number (2226456).
Almost surely, 216166161 is an apocalyptic number.
16166161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16166161 is a deficient number, since it is larger than the sum of its proper divisors (1645487).
16166161 is a wasteful number, since it uses less digits than its factorization.
16166161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14663.
The product of its digits is 1296, while the sum is 28.
The square root of 16166161 is about 4020.7164784401. The cubic root of 16166161 is about 252.8534982732.
It can be divided in two parts, 1616 and 6161, that added together give a palindrome (7777).
The spelling of 16166161 in words is "sixteen million, one hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •