Base | Representation |
---|---|
bin | 10001000101001… |
… | …01111100001101 |
3 | 100222121200110222 |
4 | 20202211330031 |
5 | 243140123104 |
6 | 22115041125 |
7 | 3356624345 |
oct | 1042457415 |
9 | 328550428 |
10 | 143286029 |
11 | 73976a07 |
12 | 3bba01a5 |
13 | 238bac43 |
14 | 1505bd25 |
15 | c8a51be |
hex | 88a5f0d |
143286029 has 2 divisors, whose sum is σ = 143286030. Its totient is φ = 143286028.
The previous prime is 143286007. The next prime is 143286037. The reversal of 143286029 is 920682341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88924900 + 54361129 = 9430^2 + 7373^2 .
It is a cyclic number.
It is not a de Polignac number, because 143286029 - 28 = 143285773 is a prime.
It is a super-2 number, since 2×1432860292 = 41061772213177682, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143286029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143286229) 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 as a sum of consecutive naturals, namely, 71643014 + 71643015.
It is an arithmetic number, because the mean of its divisors is an integer number (71643015).
Almost surely, 2143286029 is an apocalyptic number.
It is an amenable number.
143286029 is a deficient number, since it is larger than the sum of its proper divisors (1).
143286029 is an equidigital number, since it uses as much as digits as its factorization.
143286029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 35.
The square root of 143286029 is about 11970.2142420259. The cubic root of 143286029 is about 523.2805777573.
The spelling of 143286029 in words is "one hundred forty-three million, two hundred eighty-six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •