Nerdulator> put something in

Recognised as Number

-6,693

  • Negative
  • Odd
  • 4 digits

-6,693 is an odd 4-digit integer and the negative of 6,693. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value6,693
Digit count4
Digit sum24
Digit product972
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 23 × 97
Distinct prime factors33, 23, 97
Number of divisors8
Sum of divisors σ(n)9,408
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 69, 97, 291, 2,231, 6,6938 in total

Arithmetic

Previous number-6,694
Next number-6,692
Double-13,386
Cube root-18.845468637
Negation6,693
Reciprocal-0.0001494098

Representations

Decimal-6,693
Binary110100010010113 bits
Octal15045
Hexadecimal1A25
Base 3655X
In wordsminus six thousand, six hundred and ninety-three
Ordinalminus six thousand, six hundred and ninety-third
Scientific notation-6.693 × 10^3
Engineering notation-6.693 × 10^3

In other bases

Ternary100011220base 3; the most digit-efficient integer base after e: 9 digits
Quinary203233base 5; one hand: 6 digits
Septenary25341base 7: 5 digits
Nonary10156base 9; each digit is two ternary digits: 5 digits
Duodecimal3a59base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalgedbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:51:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00T11010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110010111011011
Bit length13 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits7within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21a 25
Gray code1011100110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110010111011011two's complement
32-bit11111111111111111110010111011011two's complement
64-bit1111111111111111111111111111111111111111111111111110010111011011two's complement
One's complement0001101000100100at 16 bits, every bit flipped
Bits reversed1101101110100111at 16 bits
Rotated left by 11100101110110111at 16 bits, wrapping
Shifted left by 1-11010001001010= -13,386, no wrap
Shifted right by 1-110100010011= -3,346, discarding the low bit
These bits as a double3.30678137 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+6,695
Nearest square below6,561
Nearest square above6,724

Powers & multiples

-6,693 to the power 244,796,249
-6,693 to the power 3-299,821,294,557
-6,693 to the power 42,006,703,924,470,001
-6,693 to the power 5-13,430,869,366,477,716,693
First ten multiples-6,693, -13,386, -20,079, -26,772, -33,465, -40,158, -46,851, -53,544, -60,237, -66,930
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 93

As a percentage & fraction

As a percentage-669,300%
-6,693% as a decimal-66.93
-6,693% of 100-6,693
-6,693% of 1,000-66,930
As a fraction of 100-6,693/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-6693” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.