Search a number
-
+
102011019995737 is a prime number
BaseRepresentation
bin10111001100011101001010…
…100111000010101001011001
3111101012011021101020011111001
4113030131022213002221121
5101332322032104330422
61000543114324305001
730326024113103626
oct2714351247025131
9441164241204431
10102011019995737
112a55a6a3402956
12b536504242161
1344bc7a07b6148
141b2950709934d
15bbd819e8b227
hex5cc74a9c2a59

102011019995737 has 2 divisors, whose sum is σ = 102011019995738. Its totient is φ = 102011019995736.

The previous prime is 102011019995659. The next prime is 102011019995741. The reversal of 102011019995737 is 737599910110201.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63665462316096 + 38345557679641 = 7979064^2 + 6192379^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-102011019995737 is a prime.

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

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

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

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

Almost surely, 2102011019995737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1071630, while the sum is 55.

The spelling of 102011019995737 in words is "one hundred two trillion, eleven billion, nineteen million, nine hundred ninety-five thousand, seven hundred thirty-seven".