Search a number
-
+
9201164153 is a prime number
BaseRepresentation
bin10001001000110111…
…01001111101111001
3212202020121120100112
420210123221331321
5122320444223103
64121004514105
7444004414316
oct104433517571
925666546315
109201164153
1139a18a98a5
12194954b935
13b3835443c
1463401bd0d
1538cbb5cd8
hex2246e9f79

9201164153 has 2 divisors, whose sum is σ = 9201164154. Its totient is φ = 9201164152.

The previous prime is 9201164101. The next prime is 9201164171. The reversal of 9201164153 is 3514611029.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5240601664 + 3960562489 = 72392^2 + 62933^2 .

It is a cyclic number.

It is not a de Polignac number, because 9201164153 - 220 = 9200115577 is a prime.

It is a super-2 number, since 2×92011641532 (a number of 21 digits) contains 22 as substring.

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

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

Almost surely, 29201164153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 9201164153 is about 95922.6988413066. The cubic root of 9201164153 is about 2095.4674845676.

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