Base | Representation |
---|---|
bin | 101100101010… |
… | …010001001111 |
3 | 211000210122001 |
4 | 230222101033 |
5 | 10444114341 |
6 | 1054533131 |
7 | 201340366 |
oct | 54522117 |
9 | 24023561 |
10 | 11707471 |
11 | 6676aa6 |
12 | 3b071a7 |
13 | 256bac9 |
14 | 17aa7dd |
15 | 1063d31 |
hex | b2a44f |
11707471 has 4 divisors (see below), whose sum is σ = 11750944. Its totient is φ = 11664000.
The previous prime is 11707463. The next prime is 11707489. The reversal of 11707471 is 17470711.
11707471 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17470711 = 293 ⋅59627.
It is a 7-Lehmer number, since φ(11707471) divides (11707471-1)7.
It is a cyclic number.
It is not a de Polignac number, because 11707471 - 23 = 11707463 is a prime.
It is a super-3 number, since 3×117074713 (a number of 22 digits) contains 333 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 (11707411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21330 + ... + 21871.
It is an arithmetic number, because the mean of its divisors is an integer number (2937736).
Almost surely, 211707471 is an apocalyptic number.
11707471 is a deficient number, since it is larger than the sum of its proper divisors (43473).
11707471 is an equidigital number, since it uses as much as digits as its factorization.
11707471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43472.
The product of its (nonzero) digits is 1372, while the sum is 28.
The square root of 11707471 is about 3421.6181844268. The cubic root of 11707471 is about 227.0671785233.
The spelling of 11707471 in words is "eleven million, seven hundred seven thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •