Search a number
-
+
918325206137 is a prime number
BaseRepresentation
bin11010101110100000111…
…00101001110001111001
310020210100122220000012202
431113100130221301321
5110021212223044022
61541512304115545
7123226645313333
oct15272034516171
93223318800182
10918325206137
11324506702459
12129b89305bb5
13687a01a1451
14326390a8453
1518d4b222592
hexd5d0729c79

918325206137 has 2 divisors, whose sum is σ = 918325206138. Its totient is φ = 918325206136.

The previous prime is 918325206067. The next prime is 918325206173. The reversal of 918325206137 is 731602523819.

Together with next prime (918325206173) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 665090811961 + 253234394176 = 815531^2 + 503224^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 918325206137 - 234 = 901145336953 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 918325206091 and 918325206100.

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

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

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

Almost surely, 2918325206137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 544320, while the sum is 47.

The spelling of 918325206137 in words is "nine hundred eighteen billion, three hundred twenty-five million, two hundred six thousand, one hundred thirty-seven".