Search a number
5152 = 25723
BaseRepresentation
bin1010000100000
321001211
41100200
5131102
635504
721010
oct12040
97054
105152
113964
122b94
132464
141c40
1517d7
hex1420

5152 has 24 divisors (see below), whose sum is σ = 12096. Its totient is φ = 2112.

The previous prime is 5147. The next prime is 5153. The reversal of 5152 is 2515.

Adding to 5152 its reverse (2515), we get a palindrome (7667).

5152 is an esthetic number in base 7, because in such base its adjacent digits differ by 1.

It is a pancake number, because a pancake can be divided into 5152 parts by 101 straight cuts.

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

5152 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213 + ... + 235.

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

25152 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 5152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6048).

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

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

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

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

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

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

The square root of 5152 is about 71.7774337797. Note that the first 3 decimals coincide. The cubic root of 5152 is about 17.2713102170.

The spelling of 5152 in words is "five thousand, one hundred fifty-two".