Search a number
-
+
15105013 = 711196169
BaseRepresentation
bin111001100111…
…101111110101
31001102102011221
4321213233311
512331330023
61255430341
7242250640
oct71475765
931372157
1015105013
118587690
1250853b1
13318b3a1
142012a57
1514d585d
hexe67bf5

15105013 has 8 divisors (see below), whose sum is σ = 18832320. Its totient is φ = 11770080.

The previous prime is 15104989. The next prime is 15105017. The reversal of 15105013 is 31050151.

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

It is not a de Polignac number, because 15105013 - 29 = 15104501 is a prime.

It is a super-2 number, since 2×151050132 = 456322835460338, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 215105013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 196187.

The product of its (nonzero) digits is 75, while the sum is 16.

The square root of 15105013 is about 3886.5168210108. The cubic root of 15105013 is about 247.1953903146.

Adding to 15105013 its reverse (31050151), we get a palindrome (46155164).

The spelling of 15105013 in words is "fifteen million, one hundred five thousand, thirteen".

Divisors: 1 7 11 77 196169 1373183 2157859 15105013