Search a number
-
+
69010153217 is a prime number
BaseRepresentation
bin100000001000101010…
…0110101111100000001
320121010102210000100122
41000101110311330001
52112313044400332
651411451030025
74662064423655
oct1002124657401
9217112700318
1069010153217
11272a3483585
121145b43b315
13667a3539b5
1434a938ca65
151bdd787c12
hex1011535f01

69010153217 has 2 divisors, whose sum is σ = 69010153218. Its totient is φ = 69010153216.

The previous prime is 69010153211. The next prime is 69010153271. The reversal of 69010153217 is 71235101096.

Together with next prime (69010153271) 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., 53439106561 + 15571046656 = 231169^2 + 124784^2 .

It is a cyclic number.

It is not a de Polignac number, because 69010153217 - 210 = 69010152193 is a prime.

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

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

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

Almost surely, 269010153217 is an apocalyptic number.

It is an amenable number.

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

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

69010153217 is an evil number, because the sum of its binary digits is even.

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

The spelling of 69010153217 in words is "sixty-nine billion, ten million, one hundred fifty-three thousand, two hundred seventeen".