Search a number
-
+
10166115991313 is a prime number
BaseRepresentation
bin1001001111101111101110…
…1110110111111100010001
31022222212112002202221200002
42103323323232313330101
52313030201143210223
633342125455135345
72066322555103052
oct223737356677421
938885462687602
1010166115991313
11326a4754a0a57
121182317814555
135898785132c9
14272085006729
1512969d7cae28
hex93efbbb7f11

10166115991313 has 2 divisors, whose sum is σ = 10166115991314. Its totient is φ = 10166115991312.

The previous prime is 10166115991303. The next prime is 10166115991349. The reversal of 10166115991313 is 31319951166101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9430598781184 + 735517210129 = 3070928^2 + 857623^2 .

It is a cyclic number.

It is not a de Polignac number, because 10166115991313 - 26 = 10166115991249 is a prime.

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

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

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

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

Almost surely, 210166115991313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10166115991313 in words is "ten trillion, one hundred sixty-six billion, one hundred fifteen million, nine hundred ninety-one thousand, three hundred thirteen".