Search a number
-
+
10956913 = 112831091
BaseRepresentation
bin101001110011…
…000001110001
3202121200001121
4221303001301
510301110123
61030502241
7162063232
oct51630161
922550047
1010956913
116204100
123804981
1323682a6
141653089
15e6675d
hexa73071

10956913 has 12 divisors (see below), whose sum is σ = 12199824. Its totient is φ = 9831800.

The previous prime is 10956899. The next prime is 10956917. The reversal of 10956913 is 31965901.

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

It is a de Polignac number, because none of the positive numbers 2k-10956913 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210956913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1196 (or 1185 counting only the distinct ones).

The product of its (nonzero) digits is 7290, while the sum is 34.

The square root of 10956913 is about 3310.1228073895. The cubic root of 10956913 is about 222.1072514261.

It can be divided in two parts, 1095 and 6913, that added together give a palindrome (8008).

The spelling of 10956913 in words is "ten million, nine hundred fifty-six thousand, nine hundred thirteen".

Divisors: 1 11 83 121 913 1091 10043 12001 90553 132011 996083 10956913