Search a number
-
+
15196051 = 131168927
BaseRepresentation
bin111001111101…
…111110010011
31001121001001201
4321331332103
512342233201
61301412031
7243110233
oct71757623
931531051
1015196051
11863a022
12510a017
1331c0960
142037cc3
151502801
hexe7df93

15196051 has 4 divisors (see below), whose sum is σ = 16364992. Its totient is φ = 14027112.

The previous prime is 15196043. The next prime is 15196081. The reversal of 15196051 is 15069151.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 15196051 - 23 = 15196043 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 215196051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1168940.

The product of its (nonzero) digits is 1350, while the sum is 28.

The square root of 15196051 is about 3898.2112564611. The cubic root of 15196051 is about 247.6910119512.

The spelling of 15196051 in words is "fifteen million, one hundred ninety-six thousand, fifty-one".

Divisors: 1 13 1168927 15196051