Recognised as Number
-5,171
- Negative
- Odd
- 4 digits
-5,171 is an odd 4-digit integer and the negative of 5,171. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value5,171
Digit count4
Digit sum14
Digit product35
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5,171
Distinct prime factors15,171
Number of divisors2
Sum of divisors σ(n)5,172
SquarefreeYesno repeated prime factor
All divisors1, 5,1712 in total
Arithmetic
Previous number-5,172
Next number-5,170
Double-10,342
Half-2,585.5
Square26,739,241
Cube-138,268,615,211
Cube root-17.292515724≈
Negation5,171
Reciprocal-0.0001933862≈
Representations
Decimal-5,171
Binary101000011001113 bits
Octal12063
Hexadecimal1433
Base 363ZN
In wordsminus five thousand, one hundred and seventy-one
Ordinalminus five thousand, one hundred and seventy-first
Scientific notation-5.171 × 10^3
Engineering notation-5.171 × 10^3
In other bases
Ternary21002112base 3; the most digit-efficient integer base after e: 8 digits
Quinary131141base 5; one hand: 6 digits
Septenary21035base 7: 5 digits
Nonary7075base 9; each digit is two ternary digits: 4 digits
Duodecimal2babbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalcibbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:26:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110101111001101
Bit length13 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits7within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes214 33
Gray code1111000101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110101111001101two's complement
32-bit11111111111111111110101111001101two's complement
64-bit1111111111111111111111111111111111111111111111111110101111001101two's complement
One's complement0001010000110010at 16 bits, every bit flipped
Bits reversed1011001111010111at 16 bits
Rotated left by 11101011110011011at 16 bits, wrapping
Shifted left by 1-10100001100110= -10,342, no wrap
Shifted right by 1-101000011010= -2,585, discarding the low bit
These bits as a double2.55481345 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-5,171 to the power 226,739,241
-5,171 to the power 3-138,268,615,211
-5,171 to the power 4714,987,009,256,081
-5,171 to the power 5-3,697,197,824,863,194,851
First ten multiples-5,171, -10,342, -15,513, -20,684, -25,855, -31,026, -36,197, -41,368, -46,539, -51,710
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-517,100%
-5,171% as a decimal-51.71
-5,171% of 100-5,171
-5,171% of 1,000-51,710
As a fraction of 100-5,171/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -5,171
Nerdulate something else
Nothing in mind? Surprise me · today’s page