Search a number
-
+
102312242542561 is a prime number
BaseRepresentation
bin10111010000110101101100…
…110111110111011111100001
3111102020221210002121000012011
4113100311230313313133201
5101402240433042330221
61001333332333032521
730356546514361612
oct2720655467673741
9442227702530164
10102312242542561
112a666418705727
12b58496b025741
1345120069a192c
141b39d20719c09
15bc6599b3b1e1
hex5d0d6cdf77e1

102312242542561 has 2 divisors, whose sum is σ = 102312242542562. Its totient is φ = 102312242542560.

The previous prime is 102312242542553. The next prime is 102312242542649. The reversal of 102312242542561 is 165245242213201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 52045489633536 + 50266752909025 = 7214256^2 + 7089905^2 .

It is a cyclic number.

It is not a de Polignac number, because 102312242542561 - 23 = 102312242542553 is a prime.

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

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

Almost surely, 2102312242542561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 230400, while the sum is 40.

Adding to 102312242542561 its reverse (165245242213201), we get a palindrome (267557484755762).

The spelling of 102312242542561 in words is "one hundred two trillion, three hundred twelve billion, two hundred forty-two million, five hundred forty-two thousand, five hundred sixty-one".