Recognised as Number
-142,371
- Negative
- Odd
- 6 digits
-142,371 is an odd 6-digit integer and the negative of 142,371. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value142,371
Digit count6
Digit sum18
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 5,273
Distinct prime factors23, 5,273
Number of divisors8
Sum of divisors σ(n)210,960
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 5,273, 15,819, 47,457, 142,3718 in total
Arithmetic
Representations
Decimal-142,371
Binary10001011000010001118 bits
Octal426043
Hexadecimal22C23
Base 3631UR
In wordsminus one hundred and forty-two thousand, three hundred and seventy-one
Ordinalminus one hundred and forty-two thousand, three hundred and seventy-first
Scientific notation-1.42371 × 10^5
Engineering notation-142.371 × 10^3
In other bases
Ternary21020022000base 3; the most digit-efficient integer base after e — 11 digits
Quinary14023441base 5; one hand — 8 digits
Septenary1132035base 7 — 7 digits
Nonary236260base 9; each digit is two ternary digits — 6 digits
Duodecimal6a483base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 5 digits
Vigesimalhfibbase 20; hands and feet, and the Mayan and Yoruba systems — 4 digits
Sexagesimal39:32:51base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT1TT10T01000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101010000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011101001111011101
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 2c 23
Gray code110011101000110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011101001111011101two's complement
64-bit1111111111111111111111111111111111111111111111011101001111011101two's complement
One's complement00000000000000100010110000100010at 32 bits, every bit flipped
Bits reversed10111011110010111011111111111111at 32 bits
Rotated left by 111111111111110111010011110111011at 32 bits, wrapping
Shifted left by 1-1000101100001000110= -284,742, no wrap
Shifted right by 1-10001011000010010= -71,185, discarding the low bit
These bits as a double7.03406201 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-142,371 to the power 220,269,501,641
-142,371 to the power 3-2,885,789,218,130,811
-142,371 to the power 4410,852,696,774,501,692,881
-142,371 to the power 5-58,493,509,292,482,580,517,160,851
First ten multiples-142,371, -284,742, -427,113, -569,484, -711,855, -854,226, -996,597, -1,138,968, -1,281,339, -1,423,710
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-14,237,100%
-142,371% as a decimal-1,423.71
-142,371% of 100-142,371
-142,371% of 1,000-1,423,710
As a fraction of 100-142,371/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -142,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page