Base | Representation |
---|---|
bin | 101010111111… |
… | …001100000101 |
3 | 210012111222112 |
4 | 222333030011 |
5 | 10341100434 |
6 | 1041310405 |
7 | 164532563 |
oct | 52771405 |
9 | 23174875 |
10 | 11268869 |
11 | 63a7517 |
12 | 3935405 |
13 | 2447291 |
14 | 16d4a33 |
15 | ec8dce |
hex | abf305 |
11268869 has 4 divisors (see below), whose sum is σ = 11350080. Its totient is φ = 11187660.
The previous prime is 11268853. The next prime is 11268883. The reversal of 11268869 is 96886211.
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: 96886211 = 2819 ⋅34369.
It is a cyclic number.
It is not a de Polignac number, because 11268869 - 24 = 11268853 is a prime.
It is a super-2 number, since 2×112688692 = 253974817078322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11268839) 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 3 ways as a sum of consecutive naturals, for example, 40397 + ... + 40674.
It is an arithmetic number, because the mean of its divisors is an integer number (2837520).
Almost surely, 211268869 is an apocalyptic number.
It is an amenable number.
11268869 is a deficient number, since it is larger than the sum of its proper divisors (81211).
11268869 is an equidigital number, since it uses as much as digits as its factorization.
11268869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81210.
The product of its digits is 41472, while the sum is 41.
The square root of 11268869 is about 3356.9136122337. The cubic root of 11268869 is about 224.1954408752.
The spelling of 11268869 in words is "eleven million, two hundred sixty-eight thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •