Base | Representation |
---|---|
bin | 101010100110… |
… | …110100111001 |
3 | 210000110002200 |
4 | 222212310321 |
5 | 10324402311 |
6 | 1035220413 |
7 | 163635630 |
oct | 52466471 |
9 | 23013080 |
10 | 11169081 |
11 | 6339550 |
12 | 38a7709 |
13 | 2410a31 |
14 | 16aa517 |
15 | ea9556 |
hex | aa6d39 |
11169081 has 48 divisors (see below), whose sum is σ = 20487168. Its totient is φ = 5695200.
The previous prime is 11169071. The next prime is 11169091. The reversal of 11169081 is 18096111.
It is an interprime number because it is at equal distance from previous prime (11169071) and next prime (11169091).
It is not a de Polignac number, because 11169081 - 27 = 11168953 is a prime.
It is a super-2 number, since 2×111690812 = 249496740769122, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11169001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49090 + ... + 49316.
It is an arithmetic number, because the mean of its divisors is an integer number (426816).
Almost surely, 211169081 is an apocalyptic number.
11169081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11169081 is a deficient number, since it is larger than the sum of its proper divisors (9318087).
11169081 is a wasteful number, since it uses less digits than its factorization.
11169081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322 (or 319 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 27.
The square root of 11169081 is about 3342.0175044425. The cubic root of 11169081 is about 223.5317132904.
The spelling of 11169081 in words is "eleven million, one hundred sixty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •