Recognised as Number
-3,673
- Negative
- Odd
- 4 digits
-3,673 is an odd 4-digit integer and the negative of 3,673. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,673
Digit count4
Digit sum19
Digit product378
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,673
Distinct prime factors13,673
Number of divisors2
Sum of divisors σ(n)3,674
SquarefreeYesno repeated prime factor
All divisors1, 3,6732 in total
Arithmetic
Previous number-3,674
Next number-3,672
Double-7,346
Half-1,836.5
Square13,490,929
Cube-49,552,182,217
Cube root-15.429089897≈
Negation3,673
Reciprocal-0.000272257≈
Representations
Decimal-3,673
Binary11100101100112 bits
Octal7131
HexadecimalE59
Base 362U1
In wordsminus three thousand, six hundred and seventy-three
Ordinalminus three thousand, six hundred and seventy-third
Scientific notation-3.673 × 10^3
Engineering notation-3.673 × 10^3
In other bases
Ternary12001001base 3; the most digit-efficient integer base after e: 8 digits
Quinary104143base 5; one hand: 6 digits
Septenary13465base 7: 5 digits
Nonary5031base 9; each digit is two ternary digits: 4 digits
Duodecimal2161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal93dbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:1:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1100T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111000110100111
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
Bytes20e 59
Gray code100101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111000110100111two's complement
32-bit11111111111111111111000110100111two's complement
64-bit1111111111111111111111111111111111111111111111111111000110100111two's complement
One's complement0000111001011000at 16 bits, every bit flipped
Bits reversed1110010110001111at 16 bits
Rotated left by 11110001101001111at 16 bits, wrapping
Shifted left by 1-1110010110010= -7,346, no wrap
Shifted right by 1-11100101101= -1,836, discarding the low bit
These bits as a double1.81470312 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,673 to the power 213,490,929
-3,673 to the power 3-49,552,182,217
-3,673 to the power 4182,005,165,283,041
-3,673 to the power 5-668,504,972,084,609,593
First ten multiples-3,673, -7,346, -11,019, -14,692, -18,365, -22,038, -25,711, -29,384, -33,057, -36,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-367,300%
-3,673% as a decimal-36.73
-3,673% of 100-3,673
-3,673% of 1,000-36,730
As a fraction of 100-3,673/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,673
Nerdulate something else
Nothing in mind? Surprise me · today’s page