Base | Representation |
---|---|
bin | 10001000110101… |
… | …11110011011111 |
3 | 101000000001122111 |
4 | 20203113303133 |
5 | 243213142041 |
6 | 22123254451 |
7 | 3361434661 |
oct | 1043276337 |
9 | 330001574 |
10 | 143490271 |
11 | 73aa6401 |
12 | 4007a427 |
13 | 2395cbb2 |
14 | 150b2531 |
15 | c8e5981 |
hex | 88d7cdf |
143490271 has 2 divisors, whose sum is σ = 143490272. Its totient is φ = 143490270.
The previous prime is 143490253. The next prime is 143490287. The reversal of 143490271 is 172094341.
It is a strong prime.
It is an emirp because it is prime and its reverse (172094341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 143490271 - 27 = 143490143 is a prime.
It is a Chen prime.
It is a pancake number, because a pancake can be divided into 143490271 parts by 16940 straight cuts.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143490211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71745135 + 71745136.
It is an arithmetic number, because the mean of its divisors is an integer number (71745136).
Almost surely, 2143490271 is an apocalyptic number.
143490271 is a deficient number, since it is larger than the sum of its proper divisors (1).
143490271 is an equidigital number, since it uses as much as digits as its factorization.
143490271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 143490271 is about 11978.7424632137. The cubic root of 143490271 is about 523.5290903115.
The spelling of 143490271 in words is "one hundred forty-three million, four hundred ninety thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •