Search a number
-
+
15152 = 24947
BaseRepresentation
bin11101100110000
3202210012
43230300
5441102
6154052
762114
oct35460
922705
1015152
1110425
128928
136b87
145744
154752
hex3b30

15152 has 10 divisors (see below), whose sum is σ = 29388. Its totient is φ = 7568.

The previous prime is 15149. The next prime is 15161. The reversal of 15152 is 25151.

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

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 15152.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 458 + ... + 489.

215152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 50, while the sum is 14.

The square root of 15152 is about 123.0934604274. The cubic root of 15152 is about 24.7451441006.

Subtracting 15152 from its reverse (25151), we obtain a palindrome (9999).

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

Divisors: 1 2 4 8 16 947 1894 3788 7576 15152