Recognised as Number
-3,267
- Negative
- Odd
- 4 digits
-3,267 is an odd 4-digit integer and the negative of 3,267. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,267
Digit count4
Digit sum18
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 11^2
Distinct prime factors23, 11
Number of divisors12
Sum of divisors σ(n)5,320
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 11, 27, 33, 99, 121, 297, 363, 1,089, 3,26712 in total
Arithmetic
Previous number-3,268
Next number-3,266
Double-6,534
Half-1,633.5
Square10,673,289
Cube-34,869,635,163
Cube root-14.83826233≈
Negation3,267
Reciprocal-0.0003060912≈
Representations
Decimal-3,267
Binary11001100001112 bits
Octal6303
HexadecimalCC3
Base 362IR
In wordsminus three thousand, two hundred and sixty-seven
Ordinalminus three thousand, two hundred and sixty-seventh
Scientific notation-3.267 × 10^3
Engineering notation-3.267 × 10^3
In other bases
Ternary11111000base 3; the most digit-efficient integer base after e: 8 digits
Quinary101032base 5; one hand: 6 digits
Septenary12345base 7: 5 digits
Nonary4430base 9; each digit is two ternary digits: 4 digits
Duodecimal1a83base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal837base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal54:27base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTTTT000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001100111101
Bit length12 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits6within that length
Bit parityeven6 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
Bytes20c c3
Gray code101010100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001100111101two's complement
32-bit11111111111111111111001100111101two's complement
64-bit1111111111111111111111111111111111111111111111111111001100111101two's complement
One's complement0000110011000010at 16 bits, every bit flipped
Bits reversed1011110011001111at 16 bits
Rotated left by 11110011001111011at 16 bits, wrapping
Shifted left by 1-1100110000110= -6,534, no wrap
Shifted right by 1-11001100010= -1,633, discarding the low bit
These bits as a double1.61411246 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,267 to the power 210,673,289
-3,267 to the power 3-34,869,635,163
-3,267 to the power 4113,919,098,077,521
-3,267 to the power 5-372,173,693,419,261,107
First ten multiples-3,267, -6,534, -9,801, -13,068, -16,335, -19,602, -22,869, -26,136, -29,403, -32,670
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 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-326,700%
-3,267% as a decimal-32.67
-3,267% of 100-3,267
-3,267% of 1,000-32,670
As a fraction of 100-3,267/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,267
Nerdulate something else
Nothing in mind? Surprise me · today’s page