Search a number
-
+
102932706061 is a prime number
BaseRepresentation
bin101111111011101000…
…1000111001100001101
3100211200120001020122201
41133313101013030031
53141301233043221
6115141525041501
710302524364643
oct1376721071415
9324616036581
10102932706061
113a720913619
1217b47b56291
139925292083
144da674b193
152a26939891
hex17f744730d

102932706061 has 2 divisors, whose sum is σ = 102932706062. Its totient is φ = 102932706060.

The previous prime is 102932706043. The next prime is 102932706103. The reversal of 102932706061 is 160607239201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102316177161 + 616528900 = 319869^2 + 24830^2 .

It is a cyclic number.

It is not a de Polignac number, because 102932706061 - 25 = 102932706029 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 102932706061.

It is a congruent number.

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

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

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

Almost surely, 2102932706061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 37.

The spelling of 102932706061 in words is "one hundred two billion, nine hundred thirty-two million, seven hundred six thousand, sixty-one".