Base | Representation |
---|---|
bin | 110001000100… |
… | …001010111111 |
3 | 220012110112200 |
4 | 301010022333 |
5 | 11243042033 |
6 | 1135402543 |
7 | 214216650 |
oct | 61041277 |
9 | 26173480 |
10 | 12862143 |
11 | 7295578 |
12 | 4383453 |
13 | 2884548 |
14 | 19cb527 |
15 | 11e1013 |
hex | c442bf |
12862143 has 12 divisors (see below), whose sum is σ = 21232848. Its totient is φ = 7349760.
The previous prime is 12862133. The next prime is 12862153. The reversal of 12862143 is 34126821.
12862143 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12862133) and next prime (12862153).
It is not a de Polignac number, because 12862143 - 25 = 12862111 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12862133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102018 + ... + 102143.
It is an arithmetic number, because the mean of its divisors is an integer number (1769404).
Almost surely, 212862143 is an apocalyptic number.
12862143 is a deficient number, since it is larger than the sum of its proper divisors (8370705).
12862143 is a wasteful number, since it uses less digits than its factorization.
12862143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204174 (or 204171 counting only the distinct ones).
The product of its digits is 2304, while the sum is 27.
The square root of 12862143 is about 3586.3829968368. The cubic root of 12862143 is about 234.2993648211.
Adding to 12862143 its reverse (34126821), we get a palindrome (46988964).
The spelling of 12862143 in words is "twelve million, eight hundred sixty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •