Search a number
-
+
15102152 = 2313145213
BaseRepresentation
bin111001100111…
…000011001000
31001102021020222
4321213003020
512331232102
61255405212
7242236412
oct71470310
931367228
1015102152
11858551a
125083808
133189cb0
1420119b2
1514d4aa2
hexe670c8

15102152 has 16 divisors (see below), whose sum is σ = 30494940. Its totient is φ = 6970176.

The previous prime is 15102151. The next prime is 15102161. The reversal of 15102152 is 25120151.

It can be written as a sum of positive squares in 2 ways, for example, as 15100996 + 1156 = 3886^2 + 34^2 .

It is a super-3 number, since 3×151021523 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a self number, because there is not a number n which added to its sum of digits gives 15102152.

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

Almost surely, 215102152 is an apocalyptic number.

It is an amenable number.

15102152 is an abundant number, since it is smaller than the sum of its proper divisors (15392788).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 15102152 is about 3886.1487362169. The cubic root of 15102152 is about 247.1797824572.

The spelling of 15102152 in words is "fifteen million, one hundred two thousand, one hundred fifty-two".

Divisors: 1 2 4 8 13 26 52 104 145213 290426 580852 1161704 1887769 3775538 7551076 15102152