Search a number
-
+
15106513 is a prime number
BaseRepresentation
bin111001101000…
…000111010001
31001102111020111
4321220013101
512331402023
61255441321
7242255212
oct71500721
931374214
1015106513
118588824
125086241
13318bc86
142013409
1514d600d
hexe681d1

15106513 has 2 divisors, whose sum is σ = 15106514. Its totient is φ = 15106512.

The previous prime is 15106451. The next prime is 15106519. The reversal of 15106513 is 31560151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14653584 + 452929 = 3828^2 + 673^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15106513 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 215106513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 450, while the sum is 22.

The square root of 15106513 is about 3886.7097910701. The cubic root of 15106513 is about 247.2035726051.

Adding to 15106513 its reverse (31560151), we get a palindrome (46666664).

The spelling of 15106513 in words is "fifteen million, one hundred six thousand, five hundred thirteen".