Search a number
-
+
16066161 = 33595043
BaseRepresentation
bin111101010010…
…011001110001
31010020020122000
4331102121301
513103104121
61332204213
7253363056
oct75223161
933206560
1016066161
119083821
125469669
133436a07
1421c302d
151625526
hexf52671

16066161 has 8 divisors (see below), whose sum is σ = 23801760. Its totient is φ = 10710756.

The previous prime is 16066147. The next prime is 16066163. The reversal of 16066161 is 16166061.

It is not a de Polignac number, because 16066161 - 27 = 16066033 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 595043 = 16066161 / (1 + 6 + 0 + 6 + 6 + 1 + 6 + 1).

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (16066163) 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, 297495 + ... + 297548.

It is an arithmetic number, because the mean of its divisors is an integer number (2975220).

Almost surely, 216066161 is an apocalyptic number.

It is an amenable number.

16066161 is a deficient number, since it is larger than the sum of its proper divisors (7735599).

16066161 is an equidigital number, since it uses as much as digits as its factorization.

16066161 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 595052 (or 595046 counting only the distinct ones).

The product of its (nonzero) digits is 1296, while the sum is 27.

The square root of 16066161 is about 4008.2615932596. The cubic root of 16066161 is about 252.3310558267.

The spelling of 16066161 in words is "sixteen million, sixty-six thousand, one hundred sixty-one".

Divisors: 1 3 9 27 595043 1785129 5355387 16066161