Search a number
-
+
9102001313 is a prime number
BaseRepresentation
bin10000111101000010…
…11000010010100001
3212111100000120111202
420132201120102201
5122120103020223
64103103250545
7441361506656
oct103641302241
925440016452
109102001313
11395092a339
1219202a9a55
13b209449c2
14624ba7c2d
15384129428
hex21e8584a1

9102001313 has 2 divisors, whose sum is σ = 9102001314. Its totient is φ = 9102001312.

The previous prime is 9102001303. The next prime is 9102001333. The reversal of 9102001313 is 3131002019.

It is an a-pointer prime, because the next prime (9102001333) can be obtained adding 9102001313 to its sum of digits (20).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6598800289 + 2503201024 = 81233^2 + 50032^2 .

It is an emirp because it is prime and its reverse (3131002019) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 9102001313 - 222 = 9097807009 is a prime.

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

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

Almost surely, 29102001313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 20.

The square root of 9102001313 is about 95404.4092953780. The cubic root of 9102001313 is about 2087.9125172687.

The spelling of 9102001313 in words is "nine billion, one hundred two million, one thousand, three hundred thirteen".