Search a number
-
+
507142081 is a prime number
BaseRepresentation
bin11110001110100…
…101111111000001
31022100021111011001
4132032211333001
52014312021311
6122153452001
715365431225
oct3616457701
91270244131
10507142081
112402a5396
12121a11001
13810b5b94
144b4d4785
152e7c94c1
hex1e3a5fc1

507142081 has 2 divisors, whose sum is σ = 507142082. Its totient is φ = 507142080.

The previous prime is 507142067. The next prime is 507142099. The reversal of 507142081 is 180241705.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 411278400 + 95863681 = 20280^2 + 9791^2 .

It is a cyclic number.

It is not a de Polignac number, because 507142081 - 25 = 507142049 is a prime.

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

It is equal to p26711830 and since 507142081 and 26711830 have the same sum of digits, it is a Honaker prime.

It is not a weakly prime, because it can be changed into another prime (507142681) 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, 253571040 + 253571041.

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

Almost surely, 2507142081 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 507142081 is about 22519.8152967559. The cubic root of 507142081 is about 797.4617892287.

Adding to 507142081 its reverse (180241705), we get a palindrome (687383786).

The spelling of 507142081 in words is "five hundred seven million, one hundred forty-two thousand, eighty-one".