Recognised as Number
-2,175
- Negative
- Odd
- 4 digits
-2,175 is an odd 4-digit integer and the negative of 2,175. It has 12 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,175
Digit count4
Digit sum15
Digit product70
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5^2 × 29
Distinct prime factors33, 5, 29
Number of divisors12
Sum of divisors σ(n)3,720
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 29, 75, 87, 145, 435, 725, 2,17512 in total
Arithmetic
Representations
Decimal-2,175
Binary10000111111112 bits
Octal4177
Hexadecimal87F
Base 361OF
In wordsminus two thousand, one hundred and seventy-five
Ordinalminus two thousand, one hundred and seventy-fifth
Scientific notation-2.175 × 10^3
Engineering notation-2.175 × 10^3
In other bases
Ternary2222120base 3; the most digit-efficient integer base after e: 7 digits
Quinary32200base 5; one hand: 5 digits
Septenary6225base 7: 4 digits
Nonary2876base 9; each digit is two ternary digits: 4 digits
Duodecimal1313base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal58fbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal36:15base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011110000001
Bit length12 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits4within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes208 7f
Gray code110001000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011110000001two's complement
32-bit11111111111111111111011110000001two's complement
64-bit1111111111111111111111111111111111111111111111111111011110000001two's complement
One's complement0000100001111110at 16 bits, every bit flipped
Bits reversed1000000111101111at 16 bits
Rotated left by 11110111100000011at 16 bits, wrapping
Shifted left by 1-1000011111110= -4,350, no wrap
Shifted right by 1-10001000000= -1,087, discarding the low bit
These bits as a double1.07459278 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,175 to the power 24,730,625
-2,175 to the power 3-10,289,109,375
-2,175 to the power 422,378,812,890,625
-2,175 to the power 5-48,673,918,037,109,375
First ten multiples-2,175, -4,350, -6,525, -8,700, -10,875, -13,050, -15,225, -17,400, -19,575, -21,750
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-217,500%
-2,175% as a decimal-21.75
-2,175% of 100-2,175
-2,175% of 1,000-21,750
As a fraction of 100-2,175/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,175
Nerdulate something else
Nothing in mind? Surprise me · today’s page