Search a number
BaseRepresentation
bin1010000011011
321001122
41100123
5131042
635455
721002
oct12033
97048
105147
11395a
122b8b
13245c
141c39
1517d2
hex141b

5147 has 2 divisors, whose sum is σ = 5148. Its totient is φ = 5146.

The previous prime is 5119. The next prime is 5153. The reversal of 5147 is 7415.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5147 - 212 = 1051 is a prime.

It is a Chen prime.

It is a plaindrome in base 13.

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

It is not a weakly prime, because it can be changed into another prime (5107) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2573 + 2574.

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

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

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

5147 is an evil number, because the sum of its binary digits is even.

The product of its digits is 140, while the sum is 17.

The square root of 5147 is about 71.7425954367. The cubic root of 5147 is about 17.2657211576.

The spelling of 5147 in words is "five thousand, one hundred forty-seven".