Search a number
-
+
500060507 is a prime number
BaseRepresentation
bin11101110011100…
…101000101011011
31021211221201001112
4131303211011123
52011003414012
6121342010535
715251305232
oct3563450533
91254851045
10500060507
112372a8951
1211b576a4b
137c7a67bb
144a5adb19
152dd7b122
hex1dce515b

500060507 has 2 divisors, whose sum is σ = 500060508. Its totient is φ = 500060506.

The previous prime is 500060471. The next prime is 500060521. The reversal of 500060507 is 705060005.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 500060507 - 26 = 500060443 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (500060557) 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 as a sum of consecutive naturals, namely, 250030253 + 250030254.

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

Almost surely, 2500060507 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 23.

The square root of 500060507 is about 22362.0327117192. The cubic root of 500060507 is about 793.7325409845.

The spelling of 500060507 in words is "five hundred million, sixty thousand, five hundred seven".