Base | Representation |
---|---|
bin | 10001000001100… |
… | …11011100000101 |
3 | 100221201212010121 |
4 | 20200303130011 |
5 | 243030121104 |
6 | 22101021541 |
7 | 3352632115 |
oct | 1040633405 |
9 | 327655117 |
10 | 142817029 |
11 | 73686603 |
12 | 3b9b48b1 |
13 | 23785624 |
14 | 14d79045 |
15 | c811254 |
hex | 8833705 |
142817029 has 2 divisors, whose sum is σ = 142817030. Its totient is φ = 142817028.
The previous prime is 142817027. The next prime is 142817039. The reversal of 142817029 is 920718241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128300929 + 14516100 = 11327^2 + 3810^2 .
It is an emirp because it is prime and its reverse (920718241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142817029 - 21 = 142817027 is a prime.
Together with 142817027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 142816985 and 142817003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142817023) 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, 71408514 + 71408515.
It is an arithmetic number, because the mean of its divisors is an integer number (71408515).
Almost surely, 2142817029 is an apocalyptic number.
It is an amenable number.
142817029 is a deficient number, since it is larger than the sum of its proper divisors (1).
142817029 is an equidigital number, since it uses as much as digits as its factorization.
142817029 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 34.
The square root of 142817029 is about 11950.6078924881. The cubic root of 142817029 is about 522.7090243721.
The spelling of 142817029 in words is "one hundred forty-two million, eight hundred seventeen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •