Search a number
-
+
11095679712 = 2531331594861
BaseRepresentation
bin10100101010101101…
…01010001011100000
31001122021110221010110
422111112222023200
5140210443222322
65033002531320
7541650502305
oct122526521340
931567427113
1011095679712
114784249437
122197b06b40
13107a9b7870
147738990ac
1544e18dc0c
hex2955aa2e0

11095679712 has 192 divisors, whose sum is σ = 32934021120. Its totient is φ = 3247257600.

The previous prime is 11095679671. The next prime is 11095679737. The reversal of 11095679712 is 21797659011.

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

It is a Harshad number since it is a multiple of its sum of digits (48).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2280162 + ... + 2285022.

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

Almost surely, 211095679712 is an apocalyptic number.

11095679712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11095679712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16467010560).

11095679712 is an abundant number, since it is smaller than the sum of its proper divisors (21838341408).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 238140, while the sum is 48.

The spelling of 11095679712 in words is "eleven billion, ninety-five million, six hundred seventy-nine thousand, seven hundred twelve".