Base | Representation |
---|---|
bin | 111101101011… |
… | …010011001101 |
3 | 1010102102112001 |
4 | 331223103031 |
5 | 13114340031 |
6 | 1334312301 |
7 | 254266303 |
oct | 75532315 |
9 | 33372461 |
10 | 16168141 |
11 | 9143400 |
12 | 54b8691 |
13 | 3471262 |
14 | 220c273 |
15 | 1645861 |
hex | f6b4cd |
16168141 has 12 divisors (see below), whose sum is σ = 18156096. Its totient is φ = 14380520.
The previous prime is 16168093. The next prime is 16168147. The reversal of 16168141 is 14186161.
16168141 is a nontrivial binomial coefficient, being equal to C(5687, 2).
It is a de Polignac number, because none of the positive numbers 2k-16168141 is a prime.
It is a super-2 number, since 2×161681412 = 522817566791762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16168147) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4266 + ... + 7108.
It is an arithmetic number, because the mean of its divisors is an integer number (1513008).
Almost surely, 216168141 is an apocalyptic number.
16168141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16168141 is the 5686-th triangular number.
16168141 is the 1896-th centered nonagonal number.
It is an amenable number.
16168141 is a deficient number, since it is larger than the sum of its proper divisors (1987955).
16168141 is a wasteful number, since it uses less digits than its factorization.
16168141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2912 (or 2901 counting only the distinct ones).
The product of its digits is 1152, while the sum is 28.
The square root of 16168141 is about 4020.9626956738. The cubic root of 16168141 is about 252.8638208536.
The spelling of 16168141 in words is "sixteen million, one hundred sixty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •