Base | Representation |
---|---|
bin | 101110110001… |
… | …001100101111 |
3 | 212001212202101 |
4 | 232301030233 |
5 | 11114311033 |
6 | 1114435531 |
7 | 206131600 |
oct | 56611457 |
9 | 25055671 |
10 | 12260143 |
11 | 6a14255 |
12 | 4132ba7 |
13 | 270352c |
14 | 18b1da7 |
15 | 112297d |
hex | bb132f |
12260143 has 12 divisors (see below), whose sum is σ = 14364912. Its totient is φ = 10432800.
The previous prime is 12260123. The next prime is 12260147. The reversal of 12260143 is 34106221.
It is not a de Polignac number, because 12260143 - 29 = 12259631 is a prime.
It is a super-2 number, since 2×122601432 = 300622212760898, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12260143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12260147) 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, 6571 + ... + 8227.
It is an arithmetic number, because the mean of its divisors is an integer number (1197076).
Almost surely, 212260143 is an apocalyptic number.
12260143 is a deficient number, since it is larger than the sum of its proper divisors (2104769).
12260143 is a wasteful number, since it uses less digits than its factorization.
12260143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1822 (or 1815 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 12260143 is about 3501.4487001811. The cubic root of 12260143 is about 230.5854210716.
Adding to 12260143 its reverse (34106221), we get a palindrome (46366364).
It can be divided in two parts, 12260 and 143, that added together give a triangular number (12403 = T157).
The spelling of 12260143 in words is "twelve million, two hundred sixty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •