Search a number
-
+
100016715152713 is a prime number
BaseRepresentation
bin10110101111011011110100…
…110001110011110101001001
3111010010111121211211021011211
4112233123310301303311021
5101102133213034341323
6552415013350253121
730031653303454012
oct2657336461636511
9433114554737154
10100016715152713
112996093a300877
12b273aab6571a1
1343a66c7115558
141a9ab98b44009
15b869e6e7c70d
hex5af6f4c73d49

100016715152713 has 2 divisors, whose sum is σ = 100016715152714. Its totient is φ = 100016715152712.

The previous prime is 100016715152663. The next prime is 100016715152729. The reversal of 100016715152713 is 317251517610001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 81192119784889 + 18824595367824 = 9010667^2 + 4338732^2 .

It is a cyclic number.

It is not a de Polignac number, because 100016715152713 - 221 = 100016713055561 is a prime.

It is a super-2 number, since 2×1000167151527132 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2100016715152713 is an apocalyptic number.

It is an amenable number.

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

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

100016715152713 is an evil number, because the sum of its binary digits is even.

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

The spelling of 100016715152713 in words is "one hundred trillion, sixteen billion, seven hundred fifteen million, one hundred fifty-two thousand, seven hundred thirteen".