Search a number
-
+
10956495957 = 3111441123039
BaseRepresentation
bin10100011010000111…
…01101110001010101
31001021120120122220120
422031003231301111
5134414330332312
65011111422153
7535340451621
oct121503556125
931246518816
1010956495957
114712724640
122159384959
131057c04c04
1475d1c8181
15441d4928c
hex28d0edc55

10956495957 has 16 divisors (see below), whose sum is σ = 15938519040. Its totient is φ = 6639551600.

The previous prime is 10956495883. The next prime is 10956495961. The reversal of 10956495957 is 75959465901.

10956495957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10956495957 - 216 = 10956430421 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10956495957.

It is a congruent number.

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

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

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

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

Almost surely, 210956495957 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 37464.

The product of its (nonzero) digits is 15309000, while the sum is 60.

The spelling of 10956495957 in words is "ten billion, nine hundred fifty-six million, four hundred ninety-five thousand, nine hundred fifty-seven".

Divisors: 1 3 11 33 14411 23039 43233 69117 158521 253429 475563 760287 332015029 996045087 3652165319 10956495957