Search a number
-
+
101111903974813 is a prime number
BaseRepresentation
bin10110111111010111110011…
…000111100111010110011101
3111021000012111102210212120111
4112333113303013213112131
5101223104134404143223
6555014100055450021
730204044145034564
oct2677276307472635
9437005442725514
10101111903974813
112a2433548a2686
12b4101b8086911
134455a722044a4
141ad7bb125cbdb
15ba524537430d
hex5bf5f31e759d

101111903974813 has 2 divisors, whose sum is σ = 101111903974814. Its totient is φ = 101111903974812.

The previous prime is 101111903974801. The next prime is 101111903974841. The reversal of 101111903974813 is 318479309111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60822950394649 + 40288953580164 = 7798907^2 + 6347358^2 .

It is a cyclic number.

It is not a de Polignac number, because 101111903974813 - 233 = 101103314040221 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101111903974813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 163296, while the sum is 49.

The spelling of 101111903974813 in words is "one hundred one trillion, one hundred eleven billion, nine hundred three million, nine hundred seventy-four thousand, eight hundred thirteen".