Base | Representation |
---|---|
bin | 101110110001… |
… | …111011001101 |
3 | 212002000211112 |
4 | 232301323031 |
5 | 11114404432 |
6 | 1114501405 |
7 | 206143346 |
oct | 56617315 |
9 | 25060745 |
10 | 12263117 |
11 | 6a16509 |
12 | 4134865 |
13 | 27049a9 |
14 | 18b30cd |
15 | 11237b2 |
hex | bb1ecd |
12263117 has 8 divisors (see below), whose sum is σ = 12925440. Its totient is φ = 11611600.
The previous prime is 12263101. The next prime is 12263123. The reversal of 12263117 is 71136221.
12263117 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 12263117 - 24 = 12263101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12263092 and 12263101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12263717) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317 + ... + 4962.
It is an arithmetic number, because the mean of its divisors is an integer number (1615680).
Almost surely, 212263117 is an apocalyptic number.
It is an amenable number.
12263117 is a deficient number, since it is larger than the sum of its proper divisors (662323).
12263117 is a wasteful number, since it uses less digits than its factorization.
12263117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5403.
The product of its digits is 504, while the sum is 23.
The square root of 12263117 is about 3501.8733557912. The cubic root of 12263117 is about 230.6040642908.
Adding to 12263117 its reverse (71136221), we get a palindrome (83399338).
The spelling of 12263117 in words is "twelve million, two hundred sixty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •