Base | Representation |
---|---|
bin | 101010010011… |
… | …110000100101 |
3 | 202212110222002 |
4 | 222103300211 |
5 | 10314402411 |
6 | 1033415045 |
7 | 163162136 |
oct | 52236045 |
9 | 22773862 |
10 | 11090981 |
11 | 6295900 |
12 | 386a485 |
13 | 23b4315 |
14 | 1689c8d |
15 | e9133b |
hex | a93c25 |
11090981 has 12 divisors (see below), whose sum is σ = 12372192. Its totient is φ = 9933000.
The previous prime is 11090977. The next prime is 11090983. The reversal of 11090981 is 18909011.
It is not a de Polignac number, because 11090981 - 22 = 11090977 is a prime.
It is a super-2 number, since 2×110909812 = 246019719084722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11090983) 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 11 ways as a sum of consecutive naturals, for example, 7946 + ... + 9236.
It is an arithmetic number, because the mean of its divisors is an integer number (1031016).
Almost surely, 211090981 is an apocalyptic number.
11090981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11090981 is a deficient number, since it is larger than the sum of its proper divisors (1281211).
11090981 is a wasteful number, since it uses less digits than its factorization.
11090981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384 (or 1373 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 29.
The square root of 11090981 is about 3330.3124478043. The cubic root of 11090981 is about 223.0094776348.
Adding to 11090981 its reverse (18909011), we get a palindrome (29999992).
The spelling of 11090981 in words is "eleven million, ninety thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •