Search a number
-
+
109261320141 = 3291255877243
BaseRepresentation
bin110010111000001111…
…0110110111111001101
3101110000121110011002210
41211300132312333031
53242231344221031
6122105521141033
710615411616601
oct1456036667715
9343017404083
10109261320141
1142379191a96
121921348a779
13a3c3466b2c
14540705b501
152c97334746
hex19707b6fcd

109261320141 has 8 divisors (see below), whose sum is σ = 150705269280. Its totient is φ = 70329125552.

The previous prime is 109261320137. The next prime is 109261320169. The reversal of 109261320141 is 141023162901.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 109261320141 - 22 = 109261320137 is a prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 109261320099 and 109261320108.

It is a congruent number.

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

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

Almost surely, 2109261320141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1255877275.

The product of its (nonzero) digits is 2592, while the sum is 30.

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

Divisors: 1 3 29 87 1255877243 3767631729 36420440047 109261320141