Search a number
-
+
101513768711717 is a prime number
BaseRepresentation
bin10111000101001110000100…
…000111111011011000100101
3111022102121210002012200201002
4113011032010013323120211
5101301200144242233332
6555522440451443045
730245061551656415
oct2705160407733045
9438377702180632
10101513768711717
112a388824a8545a
12b47606b8b6485
134484926c7a93b
141b0d414d4a645
15bb0915812562
hex5c53841fb625

101513768711717 has 2 divisors, whose sum is σ = 101513768711718. Its totient is φ = 101513768711716.

The previous prime is 101513768711647. The next prime is 101513768711791. The reversal of 101513768711717 is 717117867315101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97646532403876 + 3867236307841 = 9881626^2 + 1966529^2 .

It is a cyclic number.

It is not a de Polignac number, because 101513768711717 - 236 = 101445049234981 is a prime.

It is a congruent number.

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

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

Almost surely, 2101513768711717 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728720, while the sum is 56.

The spelling of 101513768711717 in words is "one hundred one trillion, five hundred thirteen billion, seven hundred sixty-eight million, seven hundred eleven thousand, seven hundred seventeen".