Search a number
-
+
11149570 = 258571301
BaseRepresentation
bin101010100010…
…000100000010
3202222110100001
4222202010002
510323241240
61034550214
7163525015
oct52420402
922873301
1011149570
116325923
12389836a
132404ba3
1416a337c
15ea389a
hexaa2102

11149570 has 16 divisors (see below), whose sum is σ = 20108088. Its totient is φ = 4451200.

The previous prime is 11149547. The next prime is 11149571. The reversal of 11149570 is 7594111.

It can be written as a sum of positive squares in 4 ways, for example, as 7789681 + 3359889 = 2791^2 + 1833^2 .

It is a super-2 number, since 2×111495702 = 248625822369800, which contains 22 as substring.

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

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

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

Almost surely, 211149570 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2165.

The product of its (nonzero) digits is 1260, while the sum is 28.

The square root of 11149570 is about 3339.0971833716. The cubic root of 11149570 is about 223.4014766937.

The spelling of 11149570 in words is "eleven million, one hundred forty-nine thousand, five hundred seventy".

Divisors: 1 2 5 10 857 1301 1714 2602 4285 6505 8570 13010 1114957 2229914 5574785 11149570