Jump to content

1024 (number): Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
Tags: Mobile edit Mobile web edit
Tags: Mobile edit Mobile web edit
Line 17: Line 17:
== Approximation to 1000 ==
== Approximation to 1000 ==
{{see also|Binary prefix}}
{{see also|Binary prefix}}
The neat coincidence that 2<sup>10</sup> is nearly equal to [[1000 (number)|10<sup>3</sup>]] provides the basis of a technique of estimating larger powers of 2 in decimal notation. Using 2<sup>10''a''+''b''</sup> ≈ 2<sup>''b''</sup>10<sup>3''a' (or 2<sup>a</sup>≈2<sup>a mod 10</sup>10<sup>floor(a/10)</sup> if “a” stands for the whole power) is fairly accurate for exponents up to about 100. For exponents up to 300, 3''a'' continues to be a good estimate of the number of digits.
The neat coincidence that 2<sup>10</sup> is nearly equal to [[1000 (number)|10<sup>3</sup>]] provides the basis of a technique of estimating larger powers of 2 in decimal notation. Using 2<sup>10''a''+''b''</sup> ≈ 2<sup>''b''</sup>10<sup>3''a'</sup>(or 2<sup>a</sup>≈2<sup>a mod 10</sup>10<sup>floor(a/10)</sup> if “a” stands for the whole power) is fairly accurate for exponents up to about 100. For exponents up to 300, 3''a'' continues to be a good estimate of the number of digits.


For example, 2<sup>53</sup> ≈ 8×10<sup>15</sup>. The actual value is closer to 9×10<sup>15</sup>.
For example, 2<sup>53</sup> ≈ 8×10<sup>15</sup>. The actual value is closer to 9×10<sup>15</sup>.

Revision as of 22:31, 17 April 2022

← 1023 1024 1025 →
Cardinalone thousand twenty-four
Ordinal1024th
(one thousand twenty-fourth)
Factorization210
Divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024
Greek numeral,ΑΚΔ´
Roman numeralMXXIV
Binary100000000002
Ternary11012213
Senary44246
Octal20008
Duodecimal71412
Hexadecimal40016
The number 1024 in a treatise on binary numbers by Leibniz (1697)

1024 is the natural number following 1023 and preceding 1025.

1024 is a power of two: 210 (2 to the tenth power).[1] It is the nearest power of two from decimal 1000 and senary 100006 (decimal 1296).

1024 is the smallest number with exactly 11 divisors (but note that there are smaller numbers with more than 11 divisors; e.g., 60 has 12 divisors) (sequence A005179 in the OEIS).

The number of groups of order 1024 is 49487365422, which is 99% of all groups of order less than 2000.[2][3]

Approximation to 1000

The neat coincidence that 210 is nearly equal to 103 provides the basis of a technique of estimating larger powers of 2 in decimal notation. Using 210a+b ≈ 2b103a'(or 2a≈2a mod 1010floor(a/10) if “a” stands for the whole power) is fairly accurate for exponents up to about 100. For exponents up to 300, 3a continues to be a good estimate of the number of digits.

For example, 253 ≈ 8×1015. The actual value is closer to 9×1015.

In the case of larger exponents, the relationship becomes increasingly inaccurate, with errors exceeding an order of magnitude for a ≥ 97. For example:

In measuring bytes, 1024 is often used in place of 1000 as the quotients of the units byte, kilobyte, megabyte, etc. In 1999, the IEC coined the term kibibyte for multiples of 1024, with kilobyte being used for multiples of 1000.

Special use in computers

In binary notation, 1024 is represented as 10000000000, making it a simple round number occurring frequently in computer applications.

1024 is the maximum number of computer memory addresses that can be referenced with ten binary switches. This is the origin of the organization of computer memory into 1024-byte chunks or kibibytes.

In the Rich Text Format (RTF), language code 1024 indicates the text is not in any language and should be skipped over when proofing. Most used languages codes in RTF are integers slightly over 1024.

1024×768 pixels and 1280×1024 pixels are common standards of display resolution.

See also

References

  1. ^ Bryan Bunch, The Kingdom of Infinite Number. New York: W. H. Freeman & Company (2000): 170
  2. ^ "Numbers of isomorphism types of finite groups of given order". www.icm.tu-bs.de. Archived from the original on 2019-07-25. Retrieved 2017-04-05.
  3. ^ Besche, Hans Ulrich; Eick, Bettina; O'Brien, E. A. (2002), "A millennium project: constructing small groups", International Journal of Algebra and Computation, 12 (5): 623–644, doi:10.1142/S0218196702001115, MR 1935567, S2CID 31716675
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy