Search a number
-
+
11011190931 = 3213293245267
BaseRepresentation
bin10100100000101000…
…10111000010010011
31001102101111110022100
422100110113002103
5140022331102211
65020344011443
7536603402316
oct122024270223
931371443270
1011011190931
1147405917a4
122173760b83
1310663452c0
1476658497d
15446a50156
hex290517093

11011190931 has 24 divisors (see below), whose sum is σ = 17719163280. Its totient is φ = 6542456256.

The previous prime is 11011190891. The next prime is 11011190963. The reversal of 11011190931 is 13909111011.

It is not a de Polignac number, because 11011190931 - 218 = 11010928787 is a prime.

It is a super-2 number, since 2×110111909312 (a number of 21 digits) contains 22 as substring.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1619241 + ... + 1626026.

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

Almost surely, 211011190931 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 243, while the sum is 27.

The spelling of 11011190931 in words is "eleven billion, eleven million, one hundred ninety thousand, nine hundred thirty-one".

Divisors: 1 3 9 13 29 39 87 117 261 377 1131 3393 3245267 9735801 29207403 42188471 94112743 126565413 282338229 379696239 847014687 1223465659 3670396977 11011190931