Search a number
-
+
100120100938069 is a prime number
BaseRepresentation
bin10110110000111100000111…
…000011010010000101010101
3111010111101110222102022210011
4112300330013003102011111
5101110331431320004234
6552534312302400221
730042303302234602
oct2660740703220525
9433441428368704
10100120100938069
11299a0772943593
12b28bb43290071
1343b3392211a84
141aa1ba57116a9
15b89548562b64
hex5b0f070d2155

100120100938069 has 2 divisors, whose sum is σ = 100120100938070. Its totient is φ = 100120100938068.

The previous prime is 100120100938057. The next prime is 100120100938073. The reversal of 100120100938069 is 960839001021001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60890710562500 + 39229390375569 = 7803250^2 + 6263337^2 .

It is a cyclic number.

It is not a de Polignac number, because 100120100938069 - 29 = 100120100937557 is a prime.

It is a super-2 number, since 2×1001201009380692 (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 (100120100738069) by changing a digit.

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

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

Almost surely, 2100120100938069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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