Search a number
-
+
15489641 = 107144763
BaseRepresentation
bin111011000101…
…101001101001
31002010221210102
4323011221221
512431132031
61311555145
7245442206
oct73055151
932127712
1015489641
11881a662
12522bab5
13329448b
1420b2cad
15155e7cb
hexec5a69

15489641 has 4 divisors (see below), whose sum is σ = 15634512. Its totient is φ = 15344772.

The previous prime is 15489637. The next prime is 15489653. The reversal of 15489641 is 14698451.

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 15489641 - 22 = 15489637 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (15489611) 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, 72275 + ... + 72488.

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

Almost surely, 215489641 is an apocalyptic number.

It is an amenable number.

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

15489641 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 144870.

The product of its digits is 34560, while the sum is 38.

The square root of 15489641 is about 3935.6881228065. The cubic root of 15489641 is about 249.2759905990.

The spelling of 15489641 in words is "fifteen million, four hundred eighty-nine thousand, six hundred forty-one".

Divisors: 1 107 144763 15489641