Recognised as Number
-8,157
- Negative
- Odd
- 4 digits
-8,157 is an odd 4-digit integer and the negative of 8,157. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value8,157
Digit count4
Digit sum21
Digit product280
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 2,719
Distinct prime factors23, 2,719
Number of divisors4
Sum of divisors σ(n)10,880
SquarefreeYesno repeated prime factor
All divisors1, 3, 2,719, 8,1574 in total
Arithmetic
Previous number-8,158
Next number-8,156
Double-16,314
Half-4,078.5
Square66,536,649
Cube-542,739,445,893
Cube root-20.129986676≈
Negation8,157
Reciprocal-0.0001225941≈
Representations
Decimal-8,157
Binary111111101110113 bits
Octal17735
Hexadecimal1FDD
Base 366AL
In wordsminus eight thousand, one hundred and fifty-seven
Ordinalminus eight thousand, one hundred and fifty-seventh
Scientific notation-8.157 × 10^3
Engineering notation-8.157 × 10^3
In other bases
Ternary102012010base 3; the most digit-efficient integer base after e: 9 digits
Quinary230112base 5; one hand: 6 digits
Septenary32532base 7: 5 digits
Nonary12163base 9; each digit is two ternary digits: 5 digits
Duodecimal4879base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal107hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:15:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT1T110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110000000100011
Bit length13 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits2within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21f dd
Gray code1000000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110000000100011two's complement
32-bit11111111111111111110000000100011two's complement
64-bit1111111111111111111111111111111111111111111111111110000000100011two's complement
One's complement0001111111011100at 16 bits, every bit flipped
Bits reversed1100010000000111at 16 bits
Rotated left by 11100000001000111at 16 bits, wrapping
Shifted left by 1-11111110111010= -16,314, no wrap
Shifted right by 1-111111101111= -4,078, discarding the low bit
These bits as a double4.03009347 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-8,157 to the power 266,536,649
-8,157 to the power 3-542,739,445,893
-8,157 to the power 44,427,125,660,149,201
-8,157 to the power 5-36,112,064,009,837,032,557
First ten multiples-8,157, -16,314, -24,471, -32,628, -40,785, -48,942, -57,099, -65,256, -73,413, -81,570
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-815,700%
-8,157% as a decimal-81.57
-8,157% of 100-8,157
-8,157% of 1,000-81,570
As a fraction of 100-8,157/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -8,157
Nerdulate something else
Nothing in mind? Surprise me · today’s page