Search a number
-
+
1606984469 is a prime number
BaseRepresentation
bin101111111001000…
…1010001100010101
311010222211021021022
41133302022030111
511242342000334
6423243130525
754552066626
oct13762121425
94128737238
101606984469
11755112242
1238a213a45
131c7c0cbac
141135d1a4d
159612d82e
hex5fc8a315

1606984469 has 2 divisors, whose sum is σ = 1606984470. Its totient is φ = 1606984468.

The previous prime is 1606984429. The next prime is 1606984471. The reversal of 1606984469 is 9644896061.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1606967569 + 16900 = 40087^2 + 130^2 .

It is a cyclic number.

It is not a de Polignac number, because 1606984469 - 212 = 1606980373 is a prime.

It is a super-2 number, since 2×16069844692 = 5164798167214423922, which contains 22 as substring.

Together with 1606984471, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1606984469.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1606984429) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 803492234 + 803492235.

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

Almost surely, 21606984469 is an apocalyptic number.

It is an amenable number.

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

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

1606984469 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2239488, while the sum is 53.

The square root of 1606984469 is about 40087.2107909742. The cubic root of 1606984469 is about 1171.3065174574.

The spelling of 1606984469 in words is "one billion, six hundred six million, nine hundred eighty-four thousand, four hundred sixty-nine".