Search a number
-
+
69100153 is a prime number
BaseRepresentation
bin1000001111001…
…10001001111001
311211000122120221
410013212021321
5120142201103
610505020041
71466225113
oct407461171
9154018527
1069100153
1136006a71
121b184621
1311415085
14926a3b3
1560ee1bd
hex41e6279

69100153 has 2 divisors, whose sum is σ = 69100154. Its totient is φ = 69100152.

The previous prime is 69100139. The next prime is 69100159. The reversal of 69100153 is 35100196.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 48958009 + 20142144 = 6997^2 + 4488^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-69100153 is a prime.

It is a super-2 number, since 2×691001532 = 9549662289246818, which contains 22 as substring.

It is equal to p4068223 and since 69100153 and 4068223 have the same sum of digits, it is a Honaker prime.

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

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

Almost surely, 269100153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 69100153 is about 8312.6501790945. The cubic root of 69100153 is about 410.3549434739.

The spelling of 69100153 in words is "sixty-nine million, one hundred thousand, one hundred fifty-three".