Base | Representation |
---|---|
bin | 10000111011010… |
… | …11111110110001 |
3 | 100220012100110002 |
4 | 20131223332301 |
5 | 242323000144 |
6 | 22031315345 |
7 | 3342660212 |
oct | 1035537661 |
9 | 326170402 |
10 | 142000049 |
11 | 73178814 |
12 | 3b67bb55 |
13 | 2355a7c9 |
14 | 14c05409 |
15 | c6ee14e |
hex | 876bfb1 |
142000049 has 2 divisors, whose sum is σ = 142000050. Its totient is φ = 142000048.
The previous prime is 142000039. The next prime is 142000069. The reversal of 142000049 is 940000241.
It is an a-pointer prime, because the next prime (142000069) can be obtained adding 142000049 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121705024 + 20295025 = 11032^2 + 4505^2 .
It is an emirp because it is prime and its reverse (940000241) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142000049 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (142000039) 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, 71000024 + 71000025.
It is an arithmetic number, because the mean of its divisors is an integer number (71000025).
Almost surely, 2142000049 is an apocalyptic number.
It is an amenable number.
142000049 is a deficient number, since it is larger than the sum of its proper divisors (1).
142000049 is an equidigital number, since it uses as much as digits as its factorization.
142000049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 142000049 is about 11916.3773438071. The cubic root of 142000049 is about 521.7104046365.
The spelling of 142000049 in words is "one hundred forty-two million, forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •