Search a number
-
+
100100001100997 is a prime number
BaseRepresentation
bin10110110000101001011001…
…000000011111010011000101
3111010102110121012000210211002
4112300221121000133103011
5101110014300240212442
6552521150005223045
730040662225364532
oct2660513100372305
9433373535023732
10100100001100997
1129993199024497
12b288073a01a85
1343b150ac4c861
141aa0c1a07bd89
15b88c6db75732
hex5b0a5901f4c5

100100001100997 has 2 divisors, whose sum is σ = 100100001100998. Its totient is φ = 100100001100996.

The previous prime is 100100001100987. The next prime is 100100001101083. The reversal of 100100001100997 is 799001100001001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 58784943773956 + 41315057327041 = 7667134^2 + 6427679^2 .

It is a cyclic number.

It is not a de Polignac number, because 100100001100997 - 230 = 100098927359173 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100100001100997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 567, while the sum is 29.

Adding to 100100001100997 its reverse (799001100001001), we get a palindrome (899101101101998).

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