Search a number
-
+
11115056670 = 235438616323
BaseRepresentation
bin10100101101000001…
…00100111000011110
31001200121221101022120
422112200210320132
5140230423303140
65034534123410
7542304265014
oct122640447036
931617841276
1011115056670
114794183653
1221a24b0566
131081a10513
147762a08b4
15450c1a1d0
hex296824e1e

11115056670 has 32 divisors (see below), whose sum is σ = 27296514432. Its totient is φ = 2895084192.

The previous prime is 11115056657. The next prime is 11115056683. The reversal of 11115056670 is 7665051111.

It is an interprime number because it is at equal distance from previous prime (11115056657) and next prime (11115056683).

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 211115056670 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 8616376.

The product of its (nonzero) digits is 6300, while the sum is 33.

The spelling of 11115056670 in words is "eleven billion, one hundred fifteen million, fifty-six thousand, six hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 43 86 129 215 258 430 645 1290 8616323 17232646 25848969 43081615 51697938 86163230 129244845 258489690 370501889 741003778 1111505667 1852509445 2223011334 3705018890 5557528335 11115056670