Base | Representation |
---|---|
bin | 101011001011… |
… | …101111110111 |
3 | 210022010112210 |
4 | 223023233313 |
5 | 10344222221 |
6 | 1042344503 |
7 | 165135552 |
oct | 53135767 |
9 | 23263483 |
10 | 11320311 |
11 | 6432132 |
12 | 395b133 |
13 | 2464812 |
14 | 1709699 |
15 | ed9276 |
hex | acbbf7 |
11320311 has 8 divisors (see below), whose sum is σ = 15306624. Its totient is φ = 7440440.
The previous prime is 11320307. The next prime is 11320313. The reversal of 11320311 is 11302311.
11320311 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11320311 - 22 = 11320307 is a prime.
It is a super-2 number, since 2×113203112 = 256298882273442, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11320313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26361 + ... + 26786.
It is an arithmetic number, because the mean of its divisors is an integer number (1913328).
Almost surely, 211320311 is an apocalyptic number.
11320311 is a deficient number, since it is larger than the sum of its proper divisors (3986313).
11320311 is an equidigital number, since it uses as much as digits as its factorization.
11320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53221.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 11320311 is about 3364.5669855124. The cubic root of 11320311 is about 224.5360712406.
Adding to 11320311 its reverse (11302311), we get a palindrome (22622622).
The spelling of 11320311 in words is "eleven million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •