Search a number
-
+
15090643 = 293791373
BaseRepresentation
bin111001100100…
…001111010011
31001101200110201
4321210033103
512330400033
61255240031
7242161021
oct71441723
931350421
1015090643
118577907
125079017
133184999
14200b711
1514d147d
hexe643d3

15090643 has 8 divisors (see below), whose sum is σ = 15663600. Its totient is φ = 14521248.

The previous prime is 15090641. The next prime is 15090671. The reversal of 15090643 is 34609051.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a 5-Lehmer number, since φ(15090643) divides (15090643-1)5.

It is a cyclic number.

It is not a de Polignac number, because 15090643 - 21 = 15090641 is a prime.

It is a Duffinian number.

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

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

Almost surely, 215090643 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1781.

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

The square root of 15090643 is about 3884.6676820547. The cubic root of 15090643 is about 247.1169765058.

Adding to 15090643 its reverse (34609051), we get a palindrome (49699694).

The spelling of 15090643 in words is "fifteen million, ninety thousand, six hundred forty-three".

Divisors: 1 29 379 1373 10991 39817 520367 15090643