Search a number
-
+
15130957 = 103914563
BaseRepresentation
bin111001101110…
…000101001101
31001110201202211
4321232011031
512333142312
61300150421
7242416402
oct71560515
931421684
1015130957
1185a5126
125098411
13319a13a
14201c2a9
1514dd3a7
hexe6e14d

15130957 has 4 divisors (see below), whose sum is σ = 15146560. Its totient is φ = 15115356.

The previous prime is 15130943. The next prime is 15130967. The reversal of 15130957 is 75903151.

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 15130957 - 223 = 6742349 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 (15130967) 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, 6243 + ... + 8320.

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

Almost surely, 215130957 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15602.

The product of its (nonzero) digits is 4725, while the sum is 31.

The square root of 15130957 is about 3889.8530820585. The cubic root of 15130957 is about 247.3368349455.

The spelling of 15130957 in words is "fifteen million, one hundred thirty thousand, nine hundred fifty-seven".

Divisors: 1 1039 14563 15130957