0.569 394 317 378 345 826 851 915 14 Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard

Convert decimal 0.569 394 317 378 345 826 851 915 14(10) to 64 bit double precision IEEE 754 binary floating point representation standard (1 bit for sign, 11 bits for exponent, 52 bits for mantissa)

What are the steps to convert decimal number
0.569 394 317 378 345 826 851 915 14(10) to 64 bit double precision IEEE 754 binary floating point representation (1 bit for sign, 11 bits for exponent, 52 bits for mantissa)

1. First, convert to binary (in base 2) the integer part: 0.
Divide the number repeatedly by 2.

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 0 ÷ 2 = 0 + 0;

2. Construct the base 2 representation of the integer part of the number.

Take all the remainders starting from the bottom of the list constructed above.

0(10) =

0(2)


3. Convert to binary (base 2) the fractional part: 0.569 394 317 378 345 826 851 915 14.

Multiply it repeatedly by 2.

Keep track of each integer part of the results.

Stop when we get a fractional part that is equal to zero.


  • #) multiplying = integer + fractional part;
  • 1) 0.569 394 317 378 345 826 851 915 14 × 2 = 1 + 0.138 788 634 756 691 653 703 830 28;
  • 2) 0.138 788 634 756 691 653 703 830 28 × 2 = 0 + 0.277 577 269 513 383 307 407 660 56;
  • 3) 0.277 577 269 513 383 307 407 660 56 × 2 = 0 + 0.555 154 539 026 766 614 815 321 12;
  • 4) 0.555 154 539 026 766 614 815 321 12 × 2 = 1 + 0.110 309 078 053 533 229 630 642 24;
  • 5) 0.110 309 078 053 533 229 630 642 24 × 2 = 0 + 0.220 618 156 107 066 459 261 284 48;
  • 6) 0.220 618 156 107 066 459 261 284 48 × 2 = 0 + 0.441 236 312 214 132 918 522 568 96;
  • 7) 0.441 236 312 214 132 918 522 568 96 × 2 = 0 + 0.882 472 624 428 265 837 045 137 92;
  • 8) 0.882 472 624 428 265 837 045 137 92 × 2 = 1 + 0.764 945 248 856 531 674 090 275 84;
  • 9) 0.764 945 248 856 531 674 090 275 84 × 2 = 1 + 0.529 890 497 713 063 348 180 551 68;
  • 10) 0.529 890 497 713 063 348 180 551 68 × 2 = 1 + 0.059 780 995 426 126 696 361 103 36;
  • 11) 0.059 780 995 426 126 696 361 103 36 × 2 = 0 + 0.119 561 990 852 253 392 722 206 72;
  • 12) 0.119 561 990 852 253 392 722 206 72 × 2 = 0 + 0.239 123 981 704 506 785 444 413 44;
  • 13) 0.239 123 981 704 506 785 444 413 44 × 2 = 0 + 0.478 247 963 409 013 570 888 826 88;
  • 14) 0.478 247 963 409 013 570 888 826 88 × 2 = 0 + 0.956 495 926 818 027 141 777 653 76;
  • 15) 0.956 495 926 818 027 141 777 653 76 × 2 = 1 + 0.912 991 853 636 054 283 555 307 52;
  • 16) 0.912 991 853 636 054 283 555 307 52 × 2 = 1 + 0.825 983 707 272 108 567 110 615 04;
  • 17) 0.825 983 707 272 108 567 110 615 04 × 2 = 1 + 0.651 967 414 544 217 134 221 230 08;
  • 18) 0.651 967 414 544 217 134 221 230 08 × 2 = 1 + 0.303 934 829 088 434 268 442 460 16;
  • 19) 0.303 934 829 088 434 268 442 460 16 × 2 = 0 + 0.607 869 658 176 868 536 884 920 32;
  • 20) 0.607 869 658 176 868 536 884 920 32 × 2 = 1 + 0.215 739 316 353 737 073 769 840 64;
  • 21) 0.215 739 316 353 737 073 769 840 64 × 2 = 0 + 0.431 478 632 707 474 147 539 681 28;
  • 22) 0.431 478 632 707 474 147 539 681 28 × 2 = 0 + 0.862 957 265 414 948 295 079 362 56;
  • 23) 0.862 957 265 414 948 295 079 362 56 × 2 = 1 + 0.725 914 530 829 896 590 158 725 12;
  • 24) 0.725 914 530 829 896 590 158 725 12 × 2 = 1 + 0.451 829 061 659 793 180 317 450 24;
  • 25) 0.451 829 061 659 793 180 317 450 24 × 2 = 0 + 0.903 658 123 319 586 360 634 900 48;
  • 26) 0.903 658 123 319 586 360 634 900 48 × 2 = 1 + 0.807 316 246 639 172 721 269 800 96;
  • 27) 0.807 316 246 639 172 721 269 800 96 × 2 = 1 + 0.614 632 493 278 345 442 539 601 92;
  • 28) 0.614 632 493 278 345 442 539 601 92 × 2 = 1 + 0.229 264 986 556 690 885 079 203 84;
  • 29) 0.229 264 986 556 690 885 079 203 84 × 2 = 0 + 0.458 529 973 113 381 770 158 407 68;
  • 30) 0.458 529 973 113 381 770 158 407 68 × 2 = 0 + 0.917 059 946 226 763 540 316 815 36;
  • 31) 0.917 059 946 226 763 540 316 815 36 × 2 = 1 + 0.834 119 892 453 527 080 633 630 72;
  • 32) 0.834 119 892 453 527 080 633 630 72 × 2 = 1 + 0.668 239 784 907 054 161 267 261 44;
  • 33) 0.668 239 784 907 054 161 267 261 44 × 2 = 1 + 0.336 479 569 814 108 322 534 522 88;
  • 34) 0.336 479 569 814 108 322 534 522 88 × 2 = 0 + 0.672 959 139 628 216 645 069 045 76;
  • 35) 0.672 959 139 628 216 645 069 045 76 × 2 = 1 + 0.345 918 279 256 433 290 138 091 52;
  • 36) 0.345 918 279 256 433 290 138 091 52 × 2 = 0 + 0.691 836 558 512 866 580 276 183 04;
  • 37) 0.691 836 558 512 866 580 276 183 04 × 2 = 1 + 0.383 673 117 025 733 160 552 366 08;
  • 38) 0.383 673 117 025 733 160 552 366 08 × 2 = 0 + 0.767 346 234 051 466 321 104 732 16;
  • 39) 0.767 346 234 051 466 321 104 732 16 × 2 = 1 + 0.534 692 468 102 932 642 209 464 32;
  • 40) 0.534 692 468 102 932 642 209 464 32 × 2 = 1 + 0.069 384 936 205 865 284 418 928 64;
  • 41) 0.069 384 936 205 865 284 418 928 64 × 2 = 0 + 0.138 769 872 411 730 568 837 857 28;
  • 42) 0.138 769 872 411 730 568 837 857 28 × 2 = 0 + 0.277 539 744 823 461 137 675 714 56;
  • 43) 0.277 539 744 823 461 137 675 714 56 × 2 = 0 + 0.555 079 489 646 922 275 351 429 12;
  • 44) 0.555 079 489 646 922 275 351 429 12 × 2 = 1 + 0.110 158 979 293 844 550 702 858 24;
  • 45) 0.110 158 979 293 844 550 702 858 24 × 2 = 0 + 0.220 317 958 587 689 101 405 716 48;
  • 46) 0.220 317 958 587 689 101 405 716 48 × 2 = 0 + 0.440 635 917 175 378 202 811 432 96;
  • 47) 0.440 635 917 175 378 202 811 432 96 × 2 = 0 + 0.881 271 834 350 756 405 622 865 92;
  • 48) 0.881 271 834 350 756 405 622 865 92 × 2 = 1 + 0.762 543 668 701 512 811 245 731 84;
  • 49) 0.762 543 668 701 512 811 245 731 84 × 2 = 1 + 0.525 087 337 403 025 622 491 463 68;
  • 50) 0.525 087 337 403 025 622 491 463 68 × 2 = 1 + 0.050 174 674 806 051 244 982 927 36;
  • 51) 0.050 174 674 806 051 244 982 927 36 × 2 = 0 + 0.100 349 349 612 102 489 965 854 72;
  • 52) 0.100 349 349 612 102 489 965 854 72 × 2 = 0 + 0.200 698 699 224 204 979 931 709 44;
  • 53) 0.200 698 699 224 204 979 931 709 44 × 2 = 0 + 0.401 397 398 448 409 959 863 418 88;

We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit) and at least one integer that was different from zero => FULL STOP (Losing precision - the converted number we get in the end will be just a very good approximation of the initial one).


4. Construct the base 2 representation of the fractional part of the number.

Take all the integer parts of the multiplying operations, starting from the top of the constructed list above:


0.569 394 317 378 345 826 851 915 14(10) =

0.1001 0001 1100 0011 1101 0011 0111 0011 1010 1011 0001 0001 1100 0(2)

5. Positive number before normalization:

0.569 394 317 378 345 826 851 915 14(10) =

0.1001 0001 1100 0011 1101 0011 0111 0011 1010 1011 0001 0001 1100 0(2)

6. Normalize the binary representation of the number.

Shift the decimal mark 1 positions to the right, so that only one non zero digit remains to the left of it:


0.569 394 317 378 345 826 851 915 14(10) =

0.1001 0001 1100 0011 1101 0011 0111 0011 1010 1011 0001 0001 1100 0(2) =

0.1001 0001 1100 0011 1101 0011 0111 0011 1010 1011 0001 0001 1100 0(2) × 20 =

1.0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000(2) × 2-1


7. Up to this moment, there are the following elements that would feed into the 64 bit double precision IEEE 754 binary floating point representation:

Sign 0 (a positive number)

Exponent (unadjusted): -1

Mantissa (not normalized):
1.0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000


8. Adjust the exponent.

Use the 11 bit excess/bias notation:


Exponent (adjusted) =

Exponent (unadjusted) + 2(11-1) - 1 =

-1 + 2(11-1) - 1 =

(-1 + 1 023)(10) =

1 022(10)


9. Convert the adjusted exponent from the decimal (base 10) to 11 bit binary.

Use the same technique of repeatedly dividing by 2:


  • division = quotient + remainder;
  • 1 022 ÷ 2 = 511 + 0;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

10. Construct the base 2 representation of the adjusted exponent.

Take all the remainders starting from the bottom of the list constructed above.


Exponent (adjusted) =

1022(10) =

011 1111 1110(2)


11. Normalize the mantissa.

a) Remove the leading (the leftmost) bit, since it's allways 1, and the decimal point, if the case.

b) Adjust its length to 52 bits, only if necessary (not the case here).


Mantissa (normalized) =

1. 0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000 =

0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000


12. The three elements that make up the number's 64 bit double precision IEEE 754 binary floating point representation:

Sign (1 bit) =
0 (a positive number)

Exponent (11 bits) =
011 1111 1110

Mantissa (52 bits) =
0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000


Decimal number 0.569 394 317 378 345 826 851 915 14 converted to 64 bit double precision IEEE 754 binary floating point representation:

0 - 011 1111 1110 - 0010 0011 1000 0111 1010 0110 1110 0111 0101 0110 0010 0011 1000

Share

» Convert decimal 0.569 394 317 378 345 826 851 914 51 to 64 bit double precision IEEE 754 binary floating point representation standard

» Calculations Performed by Our Visitors: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Data organized on a Monthly Basis

» Month 02, 2026 [February]: Decimal Numbers Converted to 64 Bit Double Precision IEEE 754 Binary Floating Point Representation Standard. Calculations performed during the month of: February - by our visitors

How to convert numbers from the decimal system (base ten) to 64 bit double precision IEEE 754 binary floating point standard

Follow the steps below to convert a base 10 decimal number to 64 bit double precision IEEE 754 binary floating point:

  • 1. If the number to be converted is negative, start with its the positive version.
  • 2. First convert the integer part. Divide repeatedly by 2 the positive representation of the integer number that is to be converted to binary, until we get a quotient that is equal to zero, keeping track of each remainder.
  • 3. Construct the base 2 representation of the positive integer part of the number, by taking all the remainders from the previous operations, starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
  • 4. Then convert the fractional part. Multiply the number repeatedly by 2, until we get a fractional part that is equal to zero, keeping track of each integer part of the results.
  • 5. Construct the base 2 representation of the fractional part of the number, by taking all the integer parts of the multiplying operations, starting from the top of the list constructed above (they should appear in the binary representation, from left to right, in the order they have been calculated).
  • 6. Normalize the binary representation of the number, shifting the decimal mark (the decimal point) "n" positions either to the left, or to the right, so that only one non zero digit remains to the left of the decimal mark.
  • 7. Adjust the exponent in 11 bit excess/bias notation and then convert it from decimal (base 10) to 11 bit binary, by using the same technique of repeatedly dividing by 2, as shown above:
    Exponent (adjusted) = Exponent (unadjusted) + 2(11-1) - 1
  • 8. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal mark, if the case) and adjust its length to 52 bits, either by removing the excess bits from the right (losing precision...) or by adding extra bits set on '0' to the right.
  • 9. Sign (it takes 1 bit) is either 1 for a negative or 0 for a positive number.

Example: convert the negative number -31.640 215 from the decimal system (base ten) to 64 bit double precision IEEE 754 binary floating point:

  • 1. Start with the positive version of the number:

    |-31.640 215| = 31.640 215

  • 2. First convert the integer part, 31. Divide it repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 31 ÷ 2 = 15 + 1;
    • 15 ÷ 2 = 7 + 1;
    • 7 ÷ 2 = 3 + 1;
    • 3 ÷ 2 = 1 + 1;
    • 1 ÷ 2 = 0 + 1;
    • We have encountered a quotient that is ZERO => FULL STOP
  • 3. Construct the base 2 representation of the integer part of the number by taking all the remainders of the previous dividing operations, starting from the bottom of the list constructed above:

    31(10) = 1 1111(2)

  • 4. Then, convert the fractional part, 0.640 215. Multiply repeatedly by 2, keeping track of each integer part of the results, until we get a fractional part that is equal to zero:
    • #) multiplying = integer + fractional part;
    • 1) 0.640 215 × 2 = 1 + 0.280 43;
    • 2) 0.280 43 × 2 = 0 + 0.560 86;
    • 3) 0.560 86 × 2 = 1 + 0.121 72;
    • 4) 0.121 72 × 2 = 0 + 0.243 44;
    • 5) 0.243 44 × 2 = 0 + 0.486 88;
    • 6) 0.486 88 × 2 = 0 + 0.973 76;
    • 7) 0.973 76 × 2 = 1 + 0.947 52;
    • 8) 0.947 52 × 2 = 1 + 0.895 04;
    • 9) 0.895 04 × 2 = 1 + 0.790 08;
    • 10) 0.790 08 × 2 = 1 + 0.580 16;
    • 11) 0.580 16 × 2 = 1 + 0.160 32;
    • 12) 0.160 32 × 2 = 0 + 0.320 64;
    • 13) 0.320 64 × 2 = 0 + 0.641 28;
    • 14) 0.641 28 × 2 = 1 + 0.282 56;
    • 15) 0.282 56 × 2 = 0 + 0.565 12;
    • 16) 0.565 12 × 2 = 1 + 0.130 24;
    • 17) 0.130 24 × 2 = 0 + 0.260 48;
    • 18) 0.260 48 × 2 = 0 + 0.520 96;
    • 19) 0.520 96 × 2 = 1 + 0.041 92;
    • 20) 0.041 92 × 2 = 0 + 0.083 84;
    • 21) 0.083 84 × 2 = 0 + 0.167 68;
    • 22) 0.167 68 × 2 = 0 + 0.335 36;
    • 23) 0.335 36 × 2 = 0 + 0.670 72;
    • 24) 0.670 72 × 2 = 1 + 0.341 44;
    • 25) 0.341 44 × 2 = 0 + 0.682 88;
    • 26) 0.682 88 × 2 = 1 + 0.365 76;
    • 27) 0.365 76 × 2 = 0 + 0.731 52;
    • 28) 0.731 52 × 2 = 1 + 0.463 04;
    • 29) 0.463 04 × 2 = 0 + 0.926 08;
    • 30) 0.926 08 × 2 = 1 + 0.852 16;
    • 31) 0.852 16 × 2 = 1 + 0.704 32;
    • 32) 0.704 32 × 2 = 1 + 0.408 64;
    • 33) 0.408 64 × 2 = 0 + 0.817 28;
    • 34) 0.817 28 × 2 = 1 + 0.634 56;
    • 35) 0.634 56 × 2 = 1 + 0.269 12;
    • 36) 0.269 12 × 2 = 0 + 0.538 24;
    • 37) 0.538 24 × 2 = 1 + 0.076 48;
    • 38) 0.076 48 × 2 = 0 + 0.152 96;
    • 39) 0.152 96 × 2 = 0 + 0.305 92;
    • 40) 0.305 92 × 2 = 0 + 0.611 84;
    • 41) 0.611 84 × 2 = 1 + 0.223 68;
    • 42) 0.223 68 × 2 = 0 + 0.447 36;
    • 43) 0.447 36 × 2 = 0 + 0.894 72;
    • 44) 0.894 72 × 2 = 1 + 0.789 44;
    • 45) 0.789 44 × 2 = 1 + 0.578 88;
    • 46) 0.578 88 × 2 = 1 + 0.157 76;
    • 47) 0.157 76 × 2 = 0 + 0.315 52;
    • 48) 0.315 52 × 2 = 0 + 0.631 04;
    • 49) 0.631 04 × 2 = 1 + 0.262 08;
    • 50) 0.262 08 × 2 = 0 + 0.524 16;
    • 51) 0.524 16 × 2 = 1 + 0.048 32;
    • 52) 0.048 32 × 2 = 0 + 0.096 64;
    • 53) 0.096 64 × 2 = 0 + 0.193 28;
    • We didn't get any fractional part that was equal to zero. But we had enough iterations (over Mantissa limit = 52) and at least one integer part that was different from zero => FULL STOP (losing precision...).
  • 5. Construct the base 2 representation of the fractional part of the number, by taking all the integer parts of the previous multiplying operations, starting from the top of the constructed list above:

    0.640 215(10) = 0.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2)

  • 6. Summarizing - the positive number before normalization:

    31.640 215(10) = 1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2)

  • 7. Normalize the binary representation of the number, shifting the decimal mark 4 positions to the left so that only one non-zero digit stays to the left of the decimal mark:

    31.640 215(10) =
    1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) =
    1 1111.1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) × 20 =
    1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0(2) × 24

  • 8. Up to this moment, there are the following elements that would feed into the 64 bit double precision IEEE 754 binary floating point representation:

    Sign: 1 (a negative number)

    Exponent (unadjusted): 4

    Mantissa (not-normalized): 1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0

  • 9. Adjust the exponent in 11 bit excess/bias notation and then convert it from decimal (base 10) to 11 bit binary (base 2), by using the same technique of repeatedly dividing it by 2, as shown above:

    Exponent (adjusted) = Exponent (unadjusted) + 2(11-1) - 1 = (4 + 1023)(10) = 1027(10) =
    100 0000 0011(2)

  • 10. Normalize mantissa, remove the leading (leftmost) bit, since it's allways '1' (and the decimal sign) and adjust its length to 52 bits, by removing the excess bits, from the right (losing precision...):

    Mantissa (not-normalized): 1.1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100 1010 0

    Mantissa (normalized): 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100

  • Conclusion:

    Sign (1 bit) = 1 (a negative number)

    Exponent (8 bits) = 100 0000 0011

    Mantissa (52 bits) = 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100

  • Number -31.640 215, converted from decimal system (base 10) to 64 bit double precision IEEE 754 binary floating point =
    1 - 100 0000 0011 - 1111 1010 0011 1110 0101 0010 0001 0101 0111 0110 1000 1001 1100