Search a number
-
+
15109121 = 31487391
BaseRepresentation
bin111001101000…
…110000000001
31001102121211002
4321220300001
512331442441
61255501345
7242265626
oct71506001
931377732
1015109121
11858a785
125087855
133190211
14201434d
1514d6b9b
hexe68c01

15109121 has 4 divisors (see below), whose sum is σ = 15596544. Its totient is φ = 14621700.

The previous prime is 15109109. The next prime is 15109139. The reversal of 15109121 is 12190151.

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.

It is a cyclic number.

It is not a de Polignac number, because 15109121 - 26 = 15109057 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 15109093 and 15109102.

It is not an unprimeable number, because it can be changed into a prime (15109181) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243665 + ... + 243726.

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

Almost surely, 215109121 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 487422.

The product of its (nonzero) digits is 90, while the sum is 20.

The square root of 15109121 is about 3887.0452788719. The cubic root of 15109121 is about 247.2177975913.

Adding to 15109121 its reverse (12190151), we get a palindrome (27299272).

The spelling of 15109121 in words is "fifteen million, one hundred nine thousand, one hundred twenty-one".

Divisors: 1 31 487391 15109121