Search a number
-
+
101109923069 is a prime number
BaseRepresentation
bin101111000101010011…
…1101111110011111101
3100122222112011021110112
41132022213233303331
53124033120014234
6114241012315405
710206412110551
oct1361247576375
9318875137415
10101109923069
1139975a087a1
1217719612b65
1396c4755c5c
144c72623861
15296b8d0ace
hex178a9efcfd

101109923069 has 2 divisors, whose sum is σ = 101109923070. Its totient is φ = 101109923068.

The previous prime is 101109923063. The next prime is 101109923071. The reversal of 101109923069 is 960329901101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 101084571844 + 25351225 = 317938^2 + 5035^2 .

It is an emirp because it is prime and its reverse (960329901101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 101109923069 - 28 = 101109922813 is a prime.

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

Together with 101109923071, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2101109923069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26244, while the sum is 41.

The spelling of 101109923069 in words is "one hundred one billion, one hundred nine million, nine hundred twenty-three thousand, sixty-nine".