Search a number
-
+
102132332302313 is a prime number
BaseRepresentation
bin10111001110001110001001…
…011000110000111111101001
3111101121202101211201212011202
4113032032021120300333221
5101341314004032133223
61001114540140133545
730340550255514005
oct2716161130607751
9441552354655152
10102132332302313
112a5a7096000365
12b555b1b5372b5
1344cb064826b81
141b31334807705
15bc1a6a263428
hex5ce389630fe9

102132332302313 has 2 divisors, whose sum is σ = 102132332302314. Its totient is φ = 102132332302312.

The previous prime is 102132332302267. The next prime is 102132332302433. The reversal of 102132332302313 is 313203233231201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89346580238224 + 12785752064089 = 9452332^2 + 3575717^2 .

It is a cyclic number.

It is not a de Polignac number, because 102132332302313 - 26 = 102132332302249 is a prime.

It is a super-3 number, since 3×1021323323023133 (a number of 43 digits) contains 333 as substring.

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

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

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

Almost surely, 2102132332302313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 29.

Adding to 102132332302313 its reverse (313203233231201), we get a palindrome (415335565533514).

The spelling of 102132332302313 in words is "one hundred two trillion, one hundred thirty-two billion, three hundred thirty-two million, three hundred two thousand, three hundred thirteen".