Search a number
-
+
10956591141 = 34396983063
BaseRepresentation
bin10100011010001000…
…00101000000100101
31001021120202111110220
422031010011000211
5134414341404031
65011113434553
7535341326256
oct121504050045
931246674426
1010956591141
11471278a101
12215940ba59
131057c39332
1475d210b2d
15441d67596
hex28d105025

10956591141 has 8 divisors (see below), whose sum is σ = 14609296320. Its totient is φ = 7304140032.

The previous prime is 10956591131. The next prime is 10956591161. The reversal of 10956591141 is 14119565901.

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

It is not a de Polignac number, because 10956591141 - 25 = 10956591109 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90376 + ... + 173438.

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

Almost surely, 210956591141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 127035.

The product of its (nonzero) digits is 48600, while the sum is 42.

The spelling of 10956591141 in words is "ten billion, nine hundred fifty-six million, five hundred ninety-one thousand, one hundred forty-one".

Divisors: 1 3 43969 83063 131907 249189 3652197047 10956591141