Search a number
-
+
69056597 is a prime number
BaseRepresentation
bin1000001110110…
…11100001010101
311210221102211202
410013123201111
5120134302342
610504042245
71465654121
oct407334125
9153842752
1069056597
1135a87275
121b163385
13113cb2bc
149258581
1560e1332
hex41db855

69056597 has 2 divisors, whose sum is σ = 69056598. Its totient is φ = 69056596.

The previous prime is 69056579. The next prime is 69056641. The reversal of 69056597 is 79565096.

Together with previous prime (69056579) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 68574961 + 481636 = 8281^2 + 694^2 .

It is a cyclic number.

It is not a de Polignac number, because 69056597 - 220 = 68008021 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 269056597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 510300, while the sum is 47.

The square root of 69056597 is about 8310.0299036766. The cubic root of 69056597 is about 410.2687054756.

The spelling of 69056597 in words is "sixty-nine million, fifty-six thousand, five hundred ninety-seven".