Recognised as Number
693
- Positive
- Odd
- Composite
- 3 digits
693 is an odd 3-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value693
Digit count3
Digit sum18
Digit product162
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7 × 11
Distinct prime factors33, 7, 11
Number of divisors12
Sum of divisors σ(n)1,248
Aliquot sum555sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)360integers below n that share no factor with it
Carmichael function λ(n)30the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 360
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 11, 21, 33, 63, 77, 99, 231, 69312 in total
Arithmetic
Representations
Decimal693
Binary101011010110 bits
Octal1265
Hexadecimal2B5
Base 36J9
Roman numeralDCXCIII
In wordssix hundred and ninety-three
Ordinalsix hundred and ninety-third
Scientific notation6.93 × 10^2
Engineering notation693
In other bases
Ternary221200base 3; the most digit-efficient integer base after e: 6 digits
Quinary10233base 5; one hand: 5 digits
Septenary2010base 7: 4 digits
Nonary850base 9; each digit is two ternary digits: 3 digits
Duodecimal499base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal1edbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal11:33base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternary100TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000001010110101
Bit length10 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits4within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 b5
Gray code1111101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0000001010110101
32-bit00000000000000000000001010110101
64-bit0000000000000000000000000000000000000000000000000000001010110101
One's complement1111110101001010at 16 bits, every bit flipped
Bits reversed1010110101000000at 16 bits
Rotated left by 10000010101101010at 16 bits, wrapping
Shifted left by 110101101010= 1,386, no wrap
Shifted right by 1101011010= 346, discarding the low bit
These bits as a double3.42387493 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
693 to the power 2480,249
693 to the power 3332,812,557
693 to the power 4230,639,102,001
693 to the power 5159,832,897,686,693
First ten multiples693, 1,386, 2,079, 2,772, 3,465, 4,158, 4,851, 5,544, 6,237, 6,930
Powers of twoBetween 2^9 (512) and 2^10 (1,024)
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 133the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps693 → 2,080 → 1,040 → 520 → 260 → 130 → 65 → 196 → 98 → 49 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage69,300%
693% as a decimal6.93
693% of 100693
693% of 1,0006,930
As a fraction of 100693/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 693
Other readings
Also reads as
#669933 (colour)
- #669933
- Green
- Dark
- Nearest: Olivedrab
#669933 is a green with RGB values 102, 153, 51 and HSL 90°, 50%, 40%. It is a dark colour, so black text on it reaches 6.2:1 contrast (AA for normal text). The nearest named colour is Olivedrab.
Colour values
#669933#669933
HEX#669933
HEX (short)#693
RGBrgb(102, 153, 51)
RGB (0–1)0.4, 0.6, 0.2
RGB percentages40%, 60%, 20%
HSLhsl(90, 50%, 40%)
HSV / HSBhsv(90, 66.7%, 60%)
CMYK33.3%, 0%, 66.7%, 40%≈naive device-independent conversion; real print needs an ICC profile
24-bit integer6,723,891
CSS custom property--colour: #669933;
Brightness & contrast
Relative luminance0.25846WCAG 2.x, 0 is black and 1 is white
Perceived brightness131 of 255ITU-R BT.601 weighting
Light or darkDark
Best text colour on this backgroundBlackcontrast 6.17:1
Contrast with white3.4:1WCAG normal text: Fail
Contrast with black6.17:1WCAG normal text: AA
Greyscale equivalent#878787
Inverted#9966CC
Colour vision & accessibility
Distinguishable without hueYesnever rely on hue alone to carry meaning
Contrast with white, large text3.4:1WCAG large text: AA
Contrast with black, large text6.17:1WCAG large text: AAA
Named colours
Hue familygreen
CSS keyword usableNo exact keyword
Colour harmonies
Complementary#663399
Analogous#999933, #339933
Triadic#336699, #993366
Split complementary#333399, #993399
Tetradic#339999, #663399, #993333
Tints, shades & saturation
Channel breakdown
R102
G153
B51
Red102 (40%)
Green153 (60%)
Blue51 (20%)
Hue90°
Saturation (HSL)50%
Lightness40%
Dominant channelGreen
Hex per channelR 66 · G 99 · B 33
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Harmonies
Similar named colours
Nerdulate something else
Nothing in mind? Surprise me · today’s page