Base | Representation |
---|---|
bin | 10001000000111… |
… | …11101100011101 |
3 | 100221120202012100 |
4 | 20200133230131 |
5 | 243020024112 |
6 | 22055155313 |
7 | 3352144254 |
oct | 1040375435 |
9 | 327522170 |
10 | 142736157 |
11 | 73630873 |
12 | 3b975b39 |
13 | 23757885 |
14 | 14d5779b |
15 | c7e72dc |
hex | 881fb1d |
142736157 has 12 divisors (see below), whose sum is σ = 209555164. Its totient is φ = 93597120.
The previous prime is 142736141. The next prime is 142736171. The reversal of 142736157 is 751637241.
It is a happy number.
142736157 is a `hidden beast` number, since 14 + 27 + 3 + 615 + 7 = 666.
142736157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 3944196 + 138791961 = 1986^2 + 11781^2 .
It is not a de Polignac number, because 142736157 - 24 = 142736141 is a prime.
It is a super-2 number, since 2×1427361572 = 40747221030257298, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142736107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 129448 + ... + 130545.
Almost surely, 2142736157 is an apocalyptic number.
It is an amenable number.
142736157 is a deficient number, since it is larger than the sum of its proper divisors (66819007).
142736157 is a wasteful number, since it uses less digits than its factorization.
142736157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260060 (or 260057 counting only the distinct ones).
The product of its digits is 35280, while the sum is 36.
The square root of 142736157 is about 11947.2238197834. The cubic root of 142736157 is about 522.6103421487.
The spelling of 142736157 in words is "one hundred forty-two million, seven hundred thirty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •