Base | Representation |
---|---|
bin | 10001000000011… |
… | …11111110010001 |
3 | 100221110110212022 |
4 | 20200033332101 |
5 | 243010444021 |
6 | 22053541225 |
7 | 3351455441 |
oct | 1040177621 |
9 | 327413768 |
10 | 142671761 |
11 | 73597451 |
12 | 3b944815 |
13 | 2373447b |
14 | 14d3c121 |
15 | c7d31ab |
hex | 880ff91 |
142671761 has 2 divisors, whose sum is σ = 142671762. Its totient is φ = 142671760.
The previous prime is 142671757. The next prime is 142671787. The reversal of 142671761 is 167176241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127803025 + 14868736 = 11305^2 + 3856^2 .
It is an emirp because it is prime and its reverse (167176241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142671761 - 22 = 142671757 is a prime.
It is a super-2 number, since 2×1426717612 = 40710462773682242, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (142631761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71335880 + 71335881.
It is an arithmetic number, because the mean of its divisors is an integer number (71335881).
Almost surely, 2142671761 is an apocalyptic number.
It is an amenable number.
142671761 is a deficient number, since it is larger than the sum of its proper divisors (1).
142671761 is an equidigital number, since it uses as much as digits as its factorization.
142671761 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14112, while the sum is 35.
The square root of 142671761 is about 11944.5284963451. The cubic root of 142671761 is about 522.5317377301.
The spelling of 142671761 in words is "one hundred forty-two million, six hundred seventy-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.886 sec. • engine limits •