Recognised as Number
-167,127
- Negative
- Odd
- 6 digits
-167,127 is an odd 6-digit integer and the negative of 167,127. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value167,127
Digit count6
Digit sum24
Digit product588
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 17 × 29 × 113
Distinct prime factors43, 17, 29, 113
Number of divisors16
Sum of divisors σ(n)246,240
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 29, 51, 87, 113, 339, 493, 1,479, 1,921, 3,277, 5,763, 9,831, 55,709, 167,12716 in total
Arithmetic
Representations
Decimal-167,127
Binary10100011001101011118 bits
Octal506327
Hexadecimal28CD7
Base 363KYF
In wordsminus one hundred and sixty-seven thousand, one hundred and twenty-seven
Ordinalminus one hundred and sixty-seven thousand, one hundred and twenty-seventh
Scientific notation-1.67127 × 10^5
Engineering notation-167.127 × 10^3
In other bases
Ternary22111020220base 3; the most digit-efficient integer base after e: 11 digits
Quinary20322002base 5; one hand: 8 digits
Septenary1264152base 7: 7 digits
Nonary274226base 9; each digit is two ternary digits: 6 digits
Duodecimal80873base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal10hg7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal46:25:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01TTTT1T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011011101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010111001100101001
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 set bits, so even; 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 8c d7
Gray code111100101010111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010111001100101001two's complement
64-bit1111111111111111111111111111111111111111111111010111001100101001two's complement
One's complement00000000000000101000110011010110at 32 bits, every bit flipped
Bits reversed10010100110011101011111111111111at 32 bits
Rotated left by 111111111111110101110011001010011at 32 bits, wrapping
Shifted left by 1-1010001100110101110= -334,254, no wrap
Shifted right by 1-10100011001101100= -83,563, discarding the low bit
These bits as a double8.25717092 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-167,127 to the power 227,931,434,129
-167,127 to the power 3-4,668,096,791,677,383
-167,127 to the power 4780,165,012,502,665,988,641
-167,127 to the power 5-130,386,638,044,533,058,683,604,407
First ten multiples-167,127, -334,254, -501,381, -668,508, -835,635, -1,002,762, -1,169,889, -1,337,016, -1,504,143, -1,671,270
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27
As a percentage & fraction
As a percentage-16,712,700%
-167,127% as a decimal-1,671.27
-167,127% of 100-167,127
-167,127% of 1,000-1,671,270
As a fraction of 100-167,127/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -167,127
Nerdulate something else
Nothing in mind? Surprise me · today’s page