Search a number
-
+
109176711397 = 1323735001911
BaseRepresentation
bin110010110101101110…
…0000110100011100101
3101102210201020120201121
41211223130012203211
53242043214231042
6122053255453541
710613333510065
oct1455334064345
9342721216647
10109176711397
1142335453206
12191ab0872b1
13a3aba81aa0
1453d9b153a5
152c8ebc0367
hex196b7068e5

109176711397 has 16 divisors (see below), whose sum is σ = 124367539968. Its totient is φ = 95076305280.

The previous prime is 109176711389. The next prime is 109176711401. The reversal of 109176711397 is 793117671901.

It is a cyclic number.

It is not a de Polignac number, because 109176711397 - 23 = 109176711389 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (109176711367) by changing a digit.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2479129 + ... + 2522782.

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

Almost surely, 2109176711397 is an apocalyptic number.

It is an amenable number.

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

109176711397 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 5002020.

The product of its (nonzero) digits is 500094, while the sum is 52.

The spelling of 109176711397 in words is "one hundred nine billion, one hundred seventy-six million, seven hundred eleven thousand, three hundred ninety-seven".

Divisors: 1 13 23 73 299 949 1679 21827 5001911 65024843 115043953 365139503 1495571389 4746813539 8398208569 109176711397