Search a number
-
+
100007038764901 is a prime number
BaseRepresentation
bin10110101111010010110100…
…000001010100011101100101
3111010002120122110222211112001
4112233102310001110131211
5101102003403410434101
6552410333243525301
730031161435513562
oct2657226401243545
9433076573884461
10100007038764901
1129957824228454
12b27204ab29831
1343a58144a24a8
141a9a51b97d869
15b8662c6e4901
hex5af4b4054765

100007038764901 has 2 divisors, whose sum is σ = 100007038764902. Its totient is φ = 100007038764900.

The previous prime is 100007038764887. The next prime is 100007038764911. The reversal of 100007038764901 is 109467830700001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 89132971932676 + 10874066832225 = 9441026^2 + 3297585^2 .

It is a cyclic number.

It is not a de Polignac number, because 100007038764901 - 211 = 100007038762853 is a prime.

It is a super-2 number, since 2×1000070387649012 (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 (100007038764911) 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, 50003519382450 + 50003519382451.

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

Almost surely, 2100007038764901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 254016, while the sum is 46.

The spelling of 100007038764901 in words is "one hundred trillion, seven billion, thirty-eight million, seven hundred sixty-four thousand, nine hundred one".