Search a number
-
+
527664041 is a prime number
BaseRepresentation
bin11111011100111…
…000001110101001
31100202220002222122
4133130320032221
52040040222131
6124205401025
716035033062
oct3734701651
91322802878
10527664041
11250941893
12128869175
138541ca58
1450117569
15314ced7b
hex1f7383a9

527664041 has 2 divisors, whose sum is σ = 527664042. Its totient is φ = 527664040.

The previous prime is 527663987. The next prime is 527664043. The reversal of 527664041 is 140466725.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 520752400 + 6911641 = 22820^2 + 2629^2 .

It is a cyclic number.

It is not a de Polignac number, because 527664041 - 214 = 527647657 is a prime.

Together with 527664043, it forms a pair of twin primes.

It is a Chen prime.

It is equal to p27734282 and since 527664041 and 27734282 have the same sum of digits, it is a Honaker prime.

It is a junction number, because it is equal to n+sod(n) for n = 527663992 and 527664010.

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

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

Almost surely, 2527664041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40320, while the sum is 35.

The square root of 527664041 is about 22970.9390535085. The cubic root of 527664041 is about 808.0765421272.

The spelling of 527664041 in words is "five hundred twenty-seven million, six hundred sixty-four thousand, forty-one".