Search a number
-
+
100738235601067 is a prime number
BaseRepresentation
bin10110111001111011110010…
…101111111001000010101011
3111012200110222211211201012111
4112321323302233321002223
5101200443401303213232
6554130301225423151
730135045250206331
oct2671736257710253
9435613884751174
10100738235601067
112a109933835879
12b36b8b333aab7
134429761c5b8ac
141ac3a84237b51
15b9a6754d9047
hex5b9ef2bf90ab

100738235601067 has 2 divisors, whose sum is σ = 100738235601068. Its totient is φ = 100738235601066.

The previous prime is 100738235601011. The next prime is 100738235601079. The reversal of 100738235601067 is 760106532837001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100738235601067 - 211 = 100738235599019 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 100738235601067.

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

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

Almost surely, 2100738235601067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1270080, while the sum is 49.

The spelling of 100738235601067 in words is "one hundred trillion, seven hundred thirty-eight billion, two hundred thirty-five million, six hundred one thousand, sixty-seven".