Base | Representation |
---|---|
bin | 110001000100… |
… | …011010010111 |
3 | 220012111220010 |
4 | 301010122113 |
5 | 11243110002 |
6 | 1135411303 |
7 | 214222554 |
oct | 61043227 |
9 | 26174803 |
10 | 12863127 |
11 | 7296292 |
12 | 4383b33 |
13 | 2884b24 |
14 | 19cba2b |
15 | 11e146c |
hex | c44697 |
12863127 has 8 divisors (see below), whose sum is σ = 17246320. Its totient is φ = 8527680.
The previous prime is 12863117. The next prime is 12863173. The reversal of 12863127 is 72136821.
12863127 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 not a de Polignac number, because 12863127 - 212 = 12859031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12863094 and 12863103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12863117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11302 + ... + 12387.
It is an arithmetic number, because the mean of its divisors is an integer number (2155790).
Almost surely, 212863127 is an apocalyptic number.
12863127 is a deficient number, since it is larger than the sum of its proper divisors (4383193).
12863127 is a wasteful number, since it uses less digits than its factorization.
12863127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23873.
The product of its digits is 4032, while the sum is 30.
The square root of 12863127 is about 3586.5201797843. The cubic root of 12863127 is about 234.3053395822.
Adding to 12863127 its reverse (72136821), we get a palindrome (84999948).
The spelling of 12863127 in words is "twelve million, eight hundred sixty-three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •