Recognised as Number
-3,251
- Negative
- Odd
- 4 digits
-3,251 is an odd 4-digit integer and the negative of 3,251. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,251
Digit count4
Digit sum11
Digit product30
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,251
Distinct prime factors13,251
Number of divisors2
Sum of divisors σ(n)3,252
SquarefreeYesno repeated prime factor
All divisors1, 3,2512 in total
Arithmetic
Previous number-3,252
Next number-3,250
Double-6,502
Half-1,625.5
Square10,569,001
Cube-34,359,822,251
Cube root-14.813999415≈
Negation3,251
Reciprocal-0.0003075977≈
Representations
Decimal-3,251
Binary11001011001112 bits
Octal6263
HexadecimalCB3
Base 362IB
In wordsminus three thousand, two hundred and fifty-one
Ordinalminus three thousand, two hundred and fifty-first
Scientific notation-3.251 × 10^3
Engineering notation-3.251 × 10^3
In other bases
Ternary11110102base 3; the most digit-efficient integer base after e: 8 digits
Quinary101001base 5; one hand: 6 digits
Septenary12323base 7: 5 digits
Nonary4412base 9; each digit is two ternary digits: 4 digits
Duodecimal1a6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal82bbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal54:11base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTTT0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001101001101
Bit length12 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits5within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20c b3
Gray code101011101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001101001101two's complement
32-bit11111111111111111111001101001101two's complement
64-bit1111111111111111111111111111111111111111111111111111001101001101two's complement
One's complement0000110010110010at 16 bits, every bit flipped
Bits reversed1011001011001111at 16 bits
Rotated left by 11110011010011011at 16 bits, wrapping
Shifted left by 1-1100101100110= -6,502, no wrap
Shifted right by 1-11001011010= -1,625, discarding the low bit
These bits as a double1.60620741 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,251 to the power 210,569,001
-3,251 to the power 3-34,359,822,251
-3,251 to the power 4111,703,782,138,001
-3,251 to the power 5-363,148,995,730,641,251
First ten multiples-3,251, -6,502, -9,753, -13,004, -16,255, -19,506, -22,757, -26,008, -29,259, -32,510
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-325,100%
-3,251% as a decimal-32.51
-3,251% of 100-3,251
-3,251% of 1,000-32,510
As a fraction of 100-3,251/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,251
Nerdulate something else
Nothing in mind? Surprise me · today’s page