Search a number
-
+
102743855611757 is a prime number
BaseRepresentation
bin10111010111000111101011…
…000001000011111101101101
3111110210012211221201200111122
4113113013223001003331231
5101431323404014034012
61002303513051030325
730432666344053253
oct2727075301037555
9443705757650448
10102743855611757
112a812473a69898
12b63454543b3a5
13454391c935679
141b52b872605d3
15bd290ba8ee72
hex5d71eb043f6d

102743855611757 has 2 divisors, whose sum is σ = 102743855611758. Its totient is φ = 102743855611756.

The previous prime is 102743855611703. The next prime is 102743855611799. The reversal of 102743855611757 is 757116558347201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75739058546761 + 27004797064996 = 8702819^2 + 5196614^2 .

It is a cyclic number.

It is not a de Polignac number, because 102743855611757 - 214 = 102743855595373 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2102743855611757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 49392000, while the sum is 62.

The spelling of 102743855611757 in words is "one hundred two trillion, seven hundred forty-three billion, eight hundred fifty-five million, six hundred eleven thousand, seven hundred fifty-seven".