Base | Representation |
---|---|
bin | 10001000000001… |
… | …01110101101001 |
3 | 100221101100220211 |
4 | 20200011311221 |
5 | 243003131444 |
6 | 22053021121 |
7 | 3351223426 |
oct | 1040056551 |
9 | 327340824 |
10 | 142630249 |
11 | 73569243 |
12 | 3b9247a1 |
13 | 2371b5c8 |
14 | 14d2ad4d |
15 | c7c5c34 |
hex | 8805d69 |
142630249 has 2 divisors, whose sum is σ = 142630250. Its totient is φ = 142630248.
The previous prime is 142630237. The next prime is 142630253. The reversal of 142630249 is 942036241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136539225 + 6091024 = 11685^2 + 2468^2 .
It is an emirp because it is prime and its reverse (942036241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142630249 - 27 = 142630121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142630249.
It is not a weakly prime, because it can be changed into another prime (142630849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71315124 + 71315125.
It is an arithmetic number, because the mean of its divisors is an integer number (71315125).
Almost surely, 2142630249 is an apocalyptic number.
It is an amenable number.
142630249 is a deficient number, since it is larger than the sum of its proper divisors (1).
142630249 is an equidigital number, since it uses as much as digits as its factorization.
142630249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The square root of 142630249 is about 11942.7906705259. The cubic root of 142630249 is about 522.4810539287.
The spelling of 142630249 in words is "one hundred forty-two million, six hundred thirty thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •