Base | Representation |
---|---|
bin | 111110001110… |
… | …001101010001 |
3 | 1010200200122121 |
4 | 332032031101 |
5 | 13133423441 |
6 | 1341334241 |
7 | 255433201 |
oct | 76161521 |
9 | 33620577 |
10 | 16311121 |
11 | 9230872 |
12 | 5567381 |
13 | 34c1368 |
14 | 2248401 |
15 | 1672dd1 |
hex | f8e351 |
16311121 has 8 divisors (see below), whose sum is σ = 16700904. Its totient is φ = 15924480.
The previous prime is 16311107. The next prime is 16311149. The reversal of 16311121 is 12111361.
It can be written as a sum of positive squares in 4 ways, for example, as 7075600 + 9235521 = 2660^2 + 3039^2 .
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 16311121 - 25 = 16311089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16311095 and 16311104.
It is not an unprimeable number, because it can be changed into a prime (16311161) 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, 12135 + ... + 13411.
It is an arithmetic number, because the mean of its divisors is an integer number (2087613).
Almost surely, 216311121 is an apocalyptic number.
It is an amenable number.
16311121 is a deficient number, since it is larger than the sum of its proper divisors (389783).
16311121 is a wasteful number, since it uses less digits than its factorization.
16311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571.
The product of its digits is 36, while the sum is 16.
The square root of 16311121 is about 4038.7028858286. The cubic root of 16311121 is about 253.6070193551.
Adding to 16311121 its reverse (12111361), we get a palindrome (28422482).
The spelling of 16311121 in words is "sixteen million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •