Search a number
-
+
108593175001 is a prime number
BaseRepresentation
bin110010100100010101…
…0000101100111011001
3101101022001012212021111
41211020222011213121
53234344323100001
6121515332340321
710563016520563
oct1451052054731
9341261185244
10108593175001
114206601a723
12190677746a1
13a317bcba8c
145382416333
152c58855851
hex1948a859d9

108593175001 has 2 divisors, whose sum is σ = 108593175002. Its totient is φ = 108593175000.

The previous prime is 108593174999. The next prime is 108593175013. The reversal of 108593175001 is 100571395801.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69340055625 + 39253119376 = 263325^2 + 198124^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 108593175001 - 21 = 108593174999 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2108593175001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 108593175001 in words is "one hundred eight billion, five hundred ninety-three million, one hundred seventy-five thousand, one".