Search a number
-
+
5063151 = 32373379
BaseRepresentation
bin10011010100000111101111
3100112020100010
4103110013233
52244010101
6300304303
761015242
oct23240757
910466303
105063151
112949025
121842093
131083762
1495b259
156a02d6
hex4d41ef

5063151 has 8 divisors (see below), whose sum is σ = 7044480. Its totient is φ = 3228632.

The previous prime is 5063147. The next prime is 5063167. The reversal of 5063151 is 1513605.

5063151 = T446 + T447 + ... + T491.

5063151 = 3092 + 3102 + ... + 3542.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 5063151 - 22 = 5063147 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36621 + ... + 36758.

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

Almost surely, 25063151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 73405.

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 5063151 is about 2250.1446620162. The cubic root of 5063151 is about 171.7144961561.

Adding to 5063151 its reverse (1513605), we get a palindrome (6576756).

The spelling of 5063151 in words is "five million, sixty-three thousand, one hundred fifty-one".

Divisors: 1 3 23 69 73379 220137 1687717 5063151