Search a number
-
+
530069071001 is a prime number
BaseRepresentation
bin1111011011010101001…
…01000010010010011001
31212200012102110210012212
413231222211002102121
532141040140233001
61043302123444505
753203414522361
oct7555245022231
91780172423185
10530069071001
1119488a1985a8
1286893086735
133aca6917892
141b9268cb9a1
15dbc58527bb
hex7b6a942499

530069071001 has 2 divisors, whose sum is σ = 530069071002. Its totient is φ = 530069071000.

The previous prime is 530069070991. The next prime is 530069071003. The reversal of 530069071001 is 100170960035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 439006955776 + 91062115225 = 662576^2 + 301765^2 .

It is a cyclic number.

It is not a de Polignac number, because 530069071001 - 226 = 530001962137 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2530069071001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 32.

The spelling of 530069071001 in words is "five hundred thirty billion, sixty-nine million, seventy-one thousand, one".