Recognised as Number
569
- Positive
- Odd
- Prime
- 3 digits
569 is an odd 3-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value569
Digit count3
Digit sum20
Digit product270
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation569
Distinct prime factors1569
Number of divisors2
Sum of divisors σ(n)570
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)568integers below n that share no factor with it
Carmichael function λ(n)568the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5692 in total
Arithmetic
Representations
Decimal569
Binary100011100110 bits
Octal1071
Hexadecimal239
Base 36FT
Roman numeralDLXIX
In wordsfive hundred and sixty-nine
Ordinalfive hundred and sixty-ninth
Scientific notation5.69 × 10^2
Engineering notation569
In other bases
Ternary210002base 3; the most digit-efficient integer base after e: 6 digits
Quinary4234base 5; one hand: 4 digits
Septenary1442base 7: 4 digits
Nonary702base 9; each digit is two ternary digits: 3 digits
Duodecimal3b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal189base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal9:29base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternary1T1001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000001000111001
Bit length10 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits5within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 39
Gray code1100100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0000001000111001
32-bit00000000000000000000001000111001
64-bit0000000000000000000000000000000000000000000000000000001000111001
One's complement1111110111000110at 16 bits, every bit flipped
Bits reversed1001110001000000at 16 bits
Rotated left by 10000010001110010at 16 bits, wrapping
Shifted left by 110001110010= 1,138, no wrap
Shifted right by 1100011100= 284, discarding the low bit
These bits as a double2.81123352 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
569 to the power 2323,761
569 to the power 3184,220,009
569 to the power 4104,821,185,121
569 to the power 559,643,254,333,849
First ten multiples569, 1,138, 1,707, 2,276, 2,845, 3,414, 3,983, 4,552, 5,121, 5,690
Powers of twoBetween 2^9 (512) and 2^10 (1,024)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 156the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps569 → 1,708 → 854 → 427 → 1,282 → 641 → 1,924 → 962 → 481 → 1,444 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage56,900%
569% as a decimal5.69
569% of 100569
569% of 1,0005,690
As a fraction of 100569/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 569
Other readings
Also reads as
#556699 (colour)
- #556699
- Blue
- Dark
- Nearest: Steel blue
#556699 is a blue with RGB values 85, 102, 153 and HSL 225°, 29%, 47%. It is a dark colour, so white text on it reaches 5.6:1 contrast (AA for normal text). The nearest named colour is Steel blue.
Colour values
#556699#556699
HEX#556699
HEX (short)#569
RGBrgb(85, 102, 153)
RGB (0–1)0.3333, 0.4, 0.6
RGB percentages33.3%, 40%, 60%
HSLhsl(225, 28.6%, 46.7%)
HSV / HSBhsv(225, 44.4%, 60%)
CMYK44.4%, 33.3%, 0%, 40%≈naive device-independent conversion; real print needs an ICC profile
24-bit integer5,596,825
CSS custom property--colour: #556699;
Brightness & contrast
Relative luminance0.13734WCAG 2.x, 0 is black and 1 is white
Perceived brightness104.6 of 255ITU-R BT.601 weighting
Light or darkDark
Best text colour on this backgroundWhitecontrast 5.6:1
Contrast with white5.6:1WCAG normal text: AA
Contrast with black3.75:1WCAG normal text: Fail
Greyscale equivalent#666666
Inverted#AA9966
Colour vision & accessibility
Distinguishable without hueYesnever rely on hue alone to carry meaning
Contrast with white, large text5.6:1WCAG large text: AAA
Contrast with black, large text3.75:1WCAG large text: AA
Named colours
Hue familyblue
CSS keyword usableNo exact keyword
Colour harmonies
Complementary#998855
Analogous#558899, #665599
Triadic#995566, #669955
Split complementary#996655, #889955
Tetradic#995588, #998855, #559966
Tints, shades & saturation
Channel breakdown
R85
G102
B153
Red85 (33.3%)
Green102 (40%)
Blue153 (60%)
Hue225°
Saturation (HSL)28.57%
Lightness46.67%
Dominant channelBlue
Hex per channelR 55 · G 66 · B 99
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