Search a number
-
+
15489701 = 113137077
BaseRepresentation
bin111011000101…
…101010100101
31002010221212122
4323011222211
512431132301
61311555325
7245442323
oct73055245
932127778
1015489701
11881a707
12522bb45
133294506
1420b2d13
15155e81b
hexec5aa5

15489701 has 4 divisors (see below), whose sum is σ = 15626892. Its totient is φ = 15352512.

The previous prime is 15489697. The next prime is 15489707. The reversal of 15489701 is 10798451.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10798451 = 17635203.

It can be written as a sum of positive squares in 2 ways, for example, as 201601 + 15288100 = 449^2 + 3910^2 .

It is a cyclic number.

It is not a de Polignac number, because 15489701 - 22 = 15489697 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 215489701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 137190.

The product of its (nonzero) digits is 10080, while the sum is 35.

The square root of 15489701 is about 3935.6957453543. The cubic root of 15489701 is about 249.2763124601.

The spelling of 15489701 in words is "fifteen million, four hundred eighty-nine thousand, seven hundred one".

Divisors: 1 113 137077 15489701