Base | Representation |
---|---|
bin | 10001000000001… |
… | …01111000011011 |
3 | 100221101101011102 |
4 | 20200011320123 |
5 | 243003133202 |
6 | 22053022015 |
7 | 3351224102 |
oct | 1040057033 |
9 | 327341142 |
10 | 142630427 |
11 | 73569395 |
12 | 3b92490b |
13 | 2371b704 |
14 | 14d2b039 |
15 | c7c5d02 |
hex | 8805e1b |
142630427 has 2 divisors, whose sum is σ = 142630428. Its totient is φ = 142630426.
The previous prime is 142630403. The next prime is 142630451. The reversal of 142630427 is 724036241.
It is a balanced prime because it is at equal distance from previous prime (142630403) and next prime (142630451).
It is an emirp because it is prime and its reverse (724036241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142630427 - 26 = 142630363 is a prime.
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 142630427.
It is not a weakly prime, because it can be changed into another prime (142630457) 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, 71315213 + 71315214.
It is an arithmetic number, because the mean of its divisors is an integer number (71315214).
Almost surely, 2142630427 is an apocalyptic number.
142630427 is a deficient number, since it is larger than the sum of its proper divisors (1).
142630427 is an equidigital number, since it uses as much as digits as its factorization.
142630427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 29.
The square root of 142630427 is about 11942.7981227181. The cubic root of 142630427 is about 522.4812712776.
Adding to 142630427 its reverse (724036241), we get a palindrome (866666668).
The spelling of 142630427 in words is "one hundred forty-two million, six hundred thirty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •