Base | Representation |
---|---|
bin | 101100101010… |
… | …101010001111 |
3 | 211000212211022 |
4 | 230222222033 |
5 | 10444142241 |
6 | 1054544355 |
7 | 201345143 |
oct | 54525217 |
9 | 24025738 |
10 | 11709071 |
11 | 6678220 |
12 | 3b080bb |
13 | 256c75a |
14 | 17ab223 |
15 | 106454b |
hex | b2aa8f |
11709071 has 8 divisors (see below), whose sum is σ = 12846288. Its totient is φ = 10584000.
The previous prime is 11709053. The next prime is 11709077. The reversal of 11709071 is 17090711.
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 11709071 - 26 = 11709007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11709071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11709077) 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 7 ways as a sum of consecutive naturals, for example, 950 + ... + 4931.
It is an arithmetic number, because the mean of its divisors is an integer number (1605786).
Almost surely, 211709071 is an apocalyptic number.
11709071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11709071 is a deficient number, since it is larger than the sum of its proper divisors (1137217).
11709071 is a wasteful number, since it uses less digits than its factorization.
11709071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6073.
The product of its (nonzero) digits is 441, while the sum is 26.
The square root of 11709071 is about 3421.8519839409. The cubic root of 11709071 is about 227.0775220875.
Adding to 11709071 its reverse (17090711), we get a palindrome (28799782).
The spelling of 11709071 in words is "eleven million, seven hundred nine thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •