Recognised as Number
-3,397
- Negative
- Odd
- 4 digits
-3,397 is an odd 4-digit integer and the negative of 3,397. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,397
Digit count4
Digit sum22
Digit product567
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 43 × 79
Distinct prime factors243, 79
Number of divisors4
Sum of divisors σ(n)3,520
SquarefreeYesno repeated prime factor
All divisors1, 43, 79, 3,3974 in total
Arithmetic
Previous number-3,398
Next number-3,396
Double-6,794
Half-1,698.5
Square11,539,609
Cube-39,200,051,773
Cube root-15.032522029≈
Negation3,397
Reciprocal-0.0002943774≈
Representations
Decimal-3,397
Binary11010100010112 bits
Octal6505
HexadecimalD45
Base 362MD
In wordsminus three thousand, three hundred and ninety-seven
Ordinalminus three thousand, three hundred and ninety-seventh
Scientific notation-3.397 × 10^3
Engineering notation-3.397 × 10^3
In other bases
Ternary11122211base 3; the most digit-efficient integer base after e: 8 digits
Quinary102042base 5; one hand: 6 digits
Septenary12622base 7: 5 digits
Nonary4584base 9; each digit is two ternary digits: 4 digits
Duodecimal1b71base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal89hbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal56:37base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT111001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001010111011
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
Bytes20d 45
Gray code101111100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001010111011two's complement
32-bit11111111111111111111001010111011two's complement
64-bit1111111111111111111111111111111111111111111111111111001010111011two's complement
One's complement0000110101000100at 16 bits, every bit flipped
Bits reversed1101110101001111at 16 bits
Rotated left by 11110010101110111at 16 bits, wrapping
Shifted left by 1-1101010001010= -6,794, no wrap
Shifted right by 1-11010100011= -1,698, discarding the low bit
These bits as a double1.678341 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,397 to the power 211,539,609
-3,397 to the power 3-39,200,051,773
-3,397 to the power 4133,162,575,872,881
-3,397 to the power 5-452,353,270,240,176,757
First ten multiples-3,397, -6,794, -10,191, -13,588, -16,985, -20,382, -23,779, -27,176, -30,573, -33,970
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-339,700%
-3,397% as a decimal-33.97
-3,397% of 100-3,397
-3,397% of 1,000-33,970
As a fraction of 100-3,397/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,397
Nerdulate something else
Nothing in mind? Surprise me · today’s page