Base | Representation |
---|---|
bin | 111110001010… |
… | …110000011101 |
3 | 1010122222021012 |
4 | 332022300131 |
5 | 13133000424 |
6 | 1341145005 |
7 | 255344042 |
oct | 76126035 |
9 | 33588235 |
10 | 16296989 |
11 | 9221195 |
12 | 555b165 |
13 | 34b7ab7 |
14 | 22431c9 |
15 | 166db0e |
hex | f8ac1d |
16296989 has 4 divisors (see below), whose sum is σ = 16503360. Its totient is φ = 16090620.
The previous prime is 16296961. The next prime is 16297019. The reversal of 16296989 is 98969261.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 98969261 = 3319 ⋅29819.
It is a cyclic number.
It is not a de Polignac number, because 16296989 - 220 = 15248413 is a prime.
It is a super-2 number, since 2×162969892 = 531183700932242, 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 (16296919) 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 3 ways as a sum of consecutive naturals, for example, 103067 + ... + 103224.
It is an arithmetic number, because the mean of its divisors is an integer number (4125840).
Almost surely, 216296989 is an apocalyptic number.
It is an amenable number.
16296989 is a deficient number, since it is larger than the sum of its proper divisors (206371).
16296989 is an equidigital number, since it uses as much as digits as its factorization.
16296989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206370.
The product of its digits is 419904, while the sum is 50.
The square root of 16296989 is about 4036.9529350737. The cubic root of 16296989 is about 253.5337562534.
The spelling of 16296989 in words is "sixteen million, two hundred ninety-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •