Search a number
-
+
109196504565 = 357992148949
BaseRepresentation
bin110010110110010011…
…1100110110111110101
3101102212002111011211220
41211230213212313311
53242113301121230
6122055244020553
710613663655111
oct1455447466765
9342762434756
10109196504565
11423456420a5
12191b5831759
13a3b2bc2015
1453dc5c8741
152c917ced10
hex196c9e6df5

109196504565 has 16 divisors (see below), whose sum is σ = 176925984000. Its totient is φ = 57500943552.

The previous prime is 109196504563. The next prime is 109196504591. The reversal of 109196504565 is 565405691901.

It is not a de Polignac number, because 109196504565 - 21 = 109196504563 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (109196504563) 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 in 15 ways as a sum of consecutive naturals, for example, 46073290 + ... + 46075659.

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

Almost surely, 2109196504565 is an apocalyptic number.

109196504565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 92149036.

The product of its (nonzero) digits is 1458000, while the sum is 51.

The spelling of 109196504565 in words is "one hundred nine billion, one hundred ninety-six million, five hundred four thousand, five hundred sixty-five".

Divisors: 1 3 5 15 79 237 395 1185 92148949 276446847 460744745 1382234235 7279766971 21839300913 36398834855 109196504565