Search a number
-
+
15029961 = 35009987
BaseRepresentation
bin111001010101…
…011011001001
31001021121020020
4321111123021
512321424321
61254051053
7241516062
oct71253311
931247206
1015029961
118536261
125049a89
13316318b
141dd3569
1514bd4c6
hexe556c9

15029961 has 4 divisors (see below), whose sum is σ = 20039952. Its totient is φ = 10019972.

The previous prime is 15029953. The next prime is 15029999. The reversal of 15029961 is 16992051.

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 15029961 - 23 = 15029953 is a prime.

It is not an unprimeable number, because it can be changed into a prime (15029951) 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 3 ways as a sum of consecutive naturals, for example, 2504991 + ... + 2504996.

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

Almost surely, 215029961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5009990.

The product of its (nonzero) digits is 4860, while the sum is 33.

The square root of 15029961 is about 3876.8493651418. The cubic root of 15029961 is about 246.7852986295.

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

Divisors: 1 3 5009987 15029961