Base | Representation |
---|---|
bin | 110000011111… |
… | …010011001101 |
3 | 212220210101010 |
4 | 300133103031 |
5 | 11223223432 |
6 | 1132235433 |
7 | 213020436 |
oct | 60372315 |
9 | 25823333 |
10 | 12711117 |
11 | 71a2061 |
12 | 430bb79 |
13 | 2830893 |
14 | 198c48d |
15 | 11b13cc |
hex | c1f4cd |
12711117 has 8 divisors (see below), whose sum is σ = 16964640. Its totient is φ = 8465840.
The previous prime is 12711109. The next prime is 12711131. The reversal of 12711117 is 71111721.
12711117 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 12711117 - 23 = 12711109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12711093 and 12711102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12711217) 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, 4867 + ... + 7007.
It is an arithmetic number, because the mean of its divisors is an integer number (2120580).
Almost surely, 212711117 is an apocalyptic number.
It is an amenable number.
12711117 is a deficient number, since it is larger than the sum of its proper divisors (4253523).
12711117 is a wasteful number, since it uses less digits than its factorization.
12711117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4123.
The product of its digits is 98, while the sum is 21.
The square root of 12711117 is about 3565.2653477687. The cubic root of 12711117 is about 233.3787120358.
Adding to 12711117 its reverse (71111721), we get a palindrome (83822838).
The spelling of 12711117 in words is "twelve million, seven hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •