Base | Representation |
---|---|
bin | 101010100111… |
… | …000010101001 |
3 | 210000111022021 |
4 | 222213002221 |
5 | 10324414321 |
6 | 1035224441 |
7 | 163641325 |
oct | 52470251 |
9 | 23014267 |
10 | 11169961 |
11 | 633a180 |
12 | 38a8121 |
13 | 241125a |
14 | 16aa985 |
15 | ea9941 |
hex | aa70a9 |
11169961 has 4 divisors (see below), whose sum is σ = 12185424. Its totient is φ = 10154500.
The previous prime is 11169953. The next prime is 11169971. The reversal of 11169961 is 16996111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16996111 = 11 ⋅1545101.
It is a cyclic number.
It is not a de Polignac number, because 11169961 - 23 = 11169953 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 15.
It is not an unprimeable number, because it can be changed into a prime (11169911) 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 3 ways as a sum of consecutive naturals, for example, 507715 + ... + 507736.
It is an arithmetic number, because the mean of its divisors is an integer number (3046356).
Almost surely, 211169961 is an apocalyptic number.
11169961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11169961 is a deficient number, since it is larger than the sum of its proper divisors (1015463).
11169961 is a wasteful number, since it uses less digits than its factorization.
11169961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015462.
The product of its digits is 2916, while the sum is 34.
The square root of 11169961 is about 3342.1491588497. The cubic root of 11169961 is about 223.5375837447.
The spelling of 11169961 in words is "eleven million, one hundred sixty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •