Search a number
-
+
101011010190997 is a prime number
BaseRepresentation
bin10110111101111001110101…
…011000010111111010010101
3111020122120001222100121102111
4112331321311120113322111
5101214431022102102442
6554455452323511021
730163542666030424
oct2675716530277225
9436576058317374
10101011010190997
112a20458a9a0575
12b3b473ab28471
1344493b34968aa
141ad2d5d61d2bb
15ba27dc939b17
hex5bde75617e95

101011010190997 has 2 divisors, whose sum is σ = 101011010190998. Its totient is φ = 101011010190996.

The previous prime is 101011010190973. The next prime is 101011010191001. The reversal of 101011010190997 is 799091010110101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99256566892081 + 1754443298916 = 9962759^2 + 1324554^2 .

It is a cyclic number.

It is not a de Polignac number, because 101011010190997 - 243 = 92214917168789 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101011010190997 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101011010190997 in words is "one hundred one trillion, eleven billion, ten million, one hundred ninety thousand, nine hundred ninety-seven".