142 = ((5)!+((55/.5)/5))
142 = 1 + 2 × 3 × 4 + 5 × 6 + 78 + 9
142 = 9 × 8 + 7 + 6 × 5 + 4 × 3 + 21
142 = 0^7 + 1^8 + 2^0 − 3^9 + 4^5 + 5^6 + 6^2 + 7^4 + 8^1 + 9^3
142 = 5^2 + 6^2 + 9^2
142 divides 5^5 - 1.
142 = (11 + 1)(1+1) − 1 − 1
142 = (2 × (2 + 2 + 2))2 − 2
142 = 3 + 33 + (333 + 3)/3
142 = 4 × (4 + 4) + (444 − 4)/4
142 = 5 × 5 + 5 + (555 + 5)/5
142 = (6 + 6) × (6 + 6) − (6 + 6)/6
142 = 7 + 7 + ((7 + 7)/7)7
142 = 88 + 8 × 8 − 8 − (8 + 8)/8
142 = 9 × (9 + 9) − 9 − 99/9
Numbers k such that k^4 + 1 is prime.
Number of ways to partition 2n+1 into distinct positive integers, n = 12
Semiprime (Product of 2 Primes)
Factors: 1, 2, 71, 142
One hundred forty-two
Representations, Binary to Hexadecimal:
10001110_2
12021_3
2032_4
1032_5
354_6
262_7
216_8
167_9
11a_11
ba_12
ac_13
a2_14
97_15
8e_16
<--- --->
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
