Search a number
-
+
15485609 is a prime number
BaseRepresentation
bin111011000100…
…101010101001
31002010202021002
4323010222221
512431014414
61311524345
7245424356
oct73045251
932122232
1015485609
118817627
1252296b5
1332926a9
1420b162d
15155d4de
hexec4aa9

15485609 has 2 divisors, whose sum is σ = 15485610. Its totient is φ = 15485608.

The previous prime is 15485581. The next prime is 15485611. The reversal of 15485609 is 90658451.

15485609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14845609 + 640000 = 3853^2 + 800^2 .

It is a cyclic number.

It is not a de Polignac number, because 15485609 - 212 = 15481513 is a prime.

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

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

It is a Chen prime.

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

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

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

Almost surely, 215485609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43200, while the sum is 38.

The square root of 15485609 is about 3935.1758537580. The cubic root of 15485609 is about 249.2543596261.

The spelling of 15485609 in words is "fifteen million, four hundred eighty-five thousand, six hundred nine".