Search a number
-
+
15020117 = 72306533
BaseRepresentation
bin111001010011…
…000001010101
31001021002201122
4321103001111
512321120432
61253533325
7241445300
oct71230125
931232648
1015020117
118529922
125044245
13315b858
141dcdb37
1514ba612
hexe53055

15020117 has 6 divisors (see below), whose sum is σ = 17472438. Its totient is φ = 12874344.

The previous prime is 15020107. The next prime is 15020123. The reversal of 15020117 is 71102051.

It can be written as a sum of positive squares in only one way, i.e., 14394436 + 625681 = 3794^2 + 791^2 .

It is not a de Polignac number, because 15020117 - 26 = 15020053 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 153218 + ... + 153315.

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

Almost surely, 215020117 is an apocalyptic number.

It is an amenable number.

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

15020117 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 306547 (or 306540 counting only the distinct ones).

The product of its (nonzero) digits is 70, while the sum is 17.

The square root of 15020117 is about 3875.5795695612. The cubic root of 15020117 is about 246.7314088235.

Adding to 15020117 its reverse (71102051), we get a palindrome (86122168).

The spelling of 15020117 in words is "fifteen million, twenty thousand, one hundred seventeen".

Divisors: 1 7 49 306533 2145731 15020117