Search a number
-
+
69215101 is a prime number
BaseRepresentation
bin1000010000000…
…10001101111101
311211020111021021
410020002031331
5120204340401
610511304141
71500214204
oct410021575
9154214237
1069215101
113608536a
121b21b051
13114554a7
14929a23b
1561232a1
hex420237d

69215101 has 2 divisors, whose sum is σ = 69215102. Its totient is φ = 69215100.

The previous prime is 69215089. The next prime is 69215129. The reversal of 69215101 is 10151296.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 39075001 + 30140100 = 6251^2 + 5490^2 .

It is a cyclic number.

It is not a de Polignac number, because 69215101 - 219 = 68690813 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 269215101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 25.

The square root of 69215101 is about 8319.5613466096. The cubic root of 69215101 is about 410.5823590279.

Adding to 69215101 its reverse (10151296), we get a palindrome (79366397).

The spelling of 69215101 in words is "sixty-nine million, two hundred fifteen thousand, one hundred one".