Search a number
-
+
501147631 is a prime number
BaseRepresentation
bin11101110111101…
…110011111101111
31021220222221022101
4131313232133233
52011243211011
6121421155531
715263453545
oct3567563757
91256887271
10501147631
112379806a6
1211b9bbba7
137ca9757a
144a7b3d95
152dee32c1
hex1ddee7ef

501147631 has 2 divisors, whose sum is σ = 501147632. Its totient is φ = 501147630.

The previous prime is 501147623. The next prime is 501147653. The reversal of 501147631 is 136741105.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 501147631 - 23 = 501147623 is a prime.

It is a super-2 number, since 2×5011476312 = 502297896113824322, which contains 22 as substring.

It is equal to p26413156 and since 501147631 and 26413156 have the same sum of digits, it is a Honaker prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2501147631 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 28.

The square root of 501147631 is about 22386.3268760197. The cubic root of 501147631 is about 794.3073121951.

Adding to 501147631 its reverse (136741105), we get a palindrome (637888736).

The spelling of 501147631 in words is "five hundred one million, one hundred forty-seven thousand, six hundred thirty-one".