Search a number
-
+
109143354115673 is a prime number
BaseRepresentation
bin11000110100001111101010…
…110110100000011001011001
3112022110000002000011222002122
4120310033222312200121121
5103301201042123200143
61024043433101311025
731663230026610653
oct3064175266403131
9468400060158078
10109143354115673
113185a489045169
12102a8868565475
1348b9235746747
141cd47d078b6d3
15c941083aec68
hex6343eada0659

109143354115673 has 2 divisors, whose sum is σ = 109143354115674. Its totient is φ = 109143354115672.

The previous prime is 109143354115669. The next prime is 109143354115709. The reversal of 109143354115673 is 376511453341901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93997620486169 + 15145733629504 = 9695237^2 + 3891752^2 .

It is a cyclic number.

It is not a de Polignac number, because 109143354115673 - 22 = 109143354115669 is a prime.

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

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

Almost surely, 2109143354115673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4082400, while the sum is 53.

The spelling of 109143354115673 in words is "one hundred nine trillion, one hundred forty-three billion, three hundred fifty-four million, one hundred fifteen thousand, six hundred seventy-three".