Search a number
-
+
12011526931 = 37331980773
BaseRepresentation
bin10110010111111000…
…10101101100010011
31011000002210210022211
423023330111230103
5144044422330211
65303520412551
7603441202645
oct131374255423
934002723284
1012011526931
115104214a68
1223b2777157
13119566c3b1
1481d37c895
154a479ae21
hex2cbf15b13

12011526931 has 8 divisors (see below), whose sum is σ = 12373444784. Its totient is φ = 11651571360.

The previous prime is 12011526929. The next prime is 12011526959. The reversal of 12011526931 is 13962511021.

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 12011526931 - 21 = 12011526929 is a prime.

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

It is a Duffinian number.

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

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

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

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

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

Almost surely, 212011526931 is an apocalyptic number.

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

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

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

The sum of its prime factors is 981141.

The product of its (nonzero) digits is 3240, while the sum is 31.

The spelling of 12011526931 in words is "twelve billion, eleven million, five hundred twenty-six thousand, nine hundred thirty-one".

Divisors: 1 37 331 12247 980773 36288601 324635863 12011526931