Search a number
-
+
15113 = 717127
BaseRepresentation
bin11101100001001
3202201202
43230021
5440423
6153545
762030
oct35411
922652
1015113
111039a
1288b5
136b57
145717
154728
hex3b09

15113 has 8 divisors (see below), whose sum is σ = 18432. Its totient is φ = 12096.

The previous prime is 15107. The next prime is 15121. The reversal of 15113 is 31151.

15113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a de Polignac number, because none of the positive numbers 2k-15113 is a prime.

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56 + ... + 182.

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

215113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 151.

The product of its digits is 15, while the sum is 11.

The square root of 15113 is about 122.9349421442. The cubic root of 15113 is about 24.7238952049.

Adding to 15113 its reverse (31151), we get a palindrome (46264).

It can be divided in two parts, 15 and 113, that added together give a 7-th power (128 = 27).

The spelling of 15113 in words is "fifteen thousand, one hundred thirteen".

Divisors: 1 7 17 119 127 889 2159 15113