Search a number
-
+
11099270 = 2571312197
BaseRepresentation
bin101010010101…
…110010000110
3202212220100002
4222111302012
510320134040
61033521302
7163225250
oct52256206
922786302
1011099270
1162a1056
123873232
1323b8020
14168ccd0
15e93a15
hexa95c86

11099270 has 32 divisors (see below), whose sum is σ = 24591168. Its totient is φ = 3512448.

The previous prime is 11099269. The next prime is 11099273. The reversal of 11099270 is 7299011.

11099270 = 632 + 642 + ... + 3222.

It is a congruent number.

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

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

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

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

Almost surely, 211099270 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 12224.

The product of its (nonzero) digits is 1134, while the sum is 29.

The square root of 11099270 is about 3331.5566931991. The cubic root of 11099270 is about 223.0650202192.

The spelling of 11099270 in words is "eleven million, ninety-nine thousand, two hundred seventy".

Divisors: 1 2 5 7 10 13 14 26 35 65 70 91 130 182 455 910 12197 24394 60985 85379 121970 158561 170758 317122 426895 792805 853790 1109927 1585610 2219854 5549635 11099270