Search a number
-
+
5201151 = 323431753
BaseRepresentation
bin10011110101110011111111
3100210020122020
4103311303333
52312414101
6303251223
762131464
oct23656377
910706566
105201151
112a3277a
1218a9b13
131101507
1499566b
156cb136
hex4f5cff

5201151 has 16 divisors (see below), whose sum is σ = 7408896. Its totient is φ = 3237696.

The previous prime is 5201129. The next prime is 5201159. The reversal of 5201151 is 1511025.

It is not a de Polignac number, because 5201151 - 27 = 5201023 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25201151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1822.

The product of its (nonzero) digits is 50, while the sum is 15.

The square root of 5201151 is about 2280.6032096794. The cubic root of 5201151 is about 173.2606027048.

Adding to 5201151 its reverse (1511025), we get a palindrome (6712176).

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

Divisors: 1 3 23 43 69 129 989 1753 2967 5259 40319 75379 120957 226137 1733717 5201151