Przejdź do treści
Number Buffet
pl

Pierwsze 50 liczby wysoce złożone

1 — 1 divisor, 2 — 2 divisors, 4 — 3 divisors, 6 — 4 divisors, 12 — 6 divisors, 24 — 8 divisors, 36 — 9 divisors, 48 — 10 divisors, 60 — 12 divisors, 120 — 16 divisors, 180 — 18 divisors, 240 — 20 divisors, 360 — 24 divisors, 720 — 30 divisors, 840 — 32 divisors, 1,260 — 36 divisors, 1,680 — 40 divisors, 2,520 — 48 divisors, 5,040 — 60 divisors, 7,560 — 64 divisors, 10,080 — 72 divisors, 15,120 — 80 divisors, 20,160 — 84 divisors, 25,200 — 90 divisors, 27,720 — 96 divisors, 45,360 — 100 divisors, 50,400 — 108 divisors, 55,440 — 120 divisors, 83,160 — 128 divisors, 110,880 — 144 divisors, 166,320 — 160 divisors, 221,760 — 168 divisors, 277,200 — 180 divisors, 332,640 — 192 divisors, 498,960 — 200 divisors, 554,400 — 216 divisors, 665,280 — 224 divisors, 720,720 — 240 divisors, 1,081,080 — 256 divisors, 1,441,440 — 288 divisors, 2,162,160 — 320 divisors, 2,882,880 — 336 divisors, 3,603,600 — 360 divisors, 4,324,320 — 384 divisors, 6,486,480 — 400 divisors, 7,207,200 — 432 divisors, 8,648,640 — 448 divisors, 10,810,800 — 480 divisors, 14,414,400 — 504 divisors, 17,297,280 — 512 divisors

The last term shown, 17,297,280, has 512 divisors — more than any smaller number.

Ustawienia

Szybkie ustawienia

Terms are produced in order from 1. The 200th has over 10^20 in it.

Group long terms as 963,761,198,400 for readability.

Dopracuj wygląd

Najpierw wybierz styl obok obrazu — te suwaki go dostrajają.

Frame

A border drawn inside the edge of the image.

Zaawansowane

Wyniki

50 wartości

1 — 1 divisor, 2 — 2 divisors, 4 — 3 divisors, 6 — 4 divisors, 12 — 6 divisors, 24 — 8 divisors, 36 — 9 divisors, 48 — 10 divisors, 60 — 12 divisors, 120 — 16 divisors, 180 — 18 divisors, 240 — 20 divisors, 360 — 24 divisors, 720 — 30 divisors, 840 — 32 divisors, 1,260 — 36 divisors, 1,680 — 40 divisors, 2,520 — 48 divisors, 5,040 — 60 divisors, 7,560 — 64 divisors, 10,080 — 72 divisors, 15,120 — 80 divisors, 20,160 — 84 divisors, 25,200 — 90 divisors, 27,720 — 96 divisors, 45,360 — 100 divisors, 50,400 — 108 divisors, 55,440 — 120 divisors, 83,160 — 128 divisors, 110,880 — 144 divisors, 166,320 — 160 divisors, 221,760 — 168 divisors, 277,200 — 180 divisors, 332,640 — 192 divisors, 498,960 — 200 divisors, 554,400 — 216 divisors, 665,280 — 224 divisors, 720,720 — 240 divisors, 1,081,080 — 256 divisors, 1,441,440 — 288 divisors, 2,162,160 — 320 divisors, 2,882,880 — 336 divisors, 3,603,600 — 360 divisors, 4,324,320 — 384 divisors, 6,486,480 — 400 divisors, 7,207,200 — 432 divisors, 8,648,640 — 448 divisors, 10,810,800 — 480 divisors, 14,414,400 — 504 divisors, 17,297,280 — 512 divisors

The last term shown, 17,297,280, has 512 divisors — more than any smaller number.

Utwórz obraz

Włącz JavaScript, aby ostylować te liczby i pobrać je jako obraz. Same wartości są wypisane powyżej.

Text on the image

Drag a line straight onto the picture to place it — once placed, it stays exactly where you put it. Everything here is drawn into the download.

Jakie są pierwsze 50 liczby wysoce złożone?

Pierwsze 50 liczby wysoce złożone to:

1 — 1 divisor, 2 — 2 divisors, 4 — 3 divisors, 6 — 4 divisors, 12 — 6 divisors, 24 — 8 divisors, 36 — 9 divisors, 48 — 10 divisors, 60 — 12 divisors, 120 — 16 divisors, 180 — 18 divisors, 240 — 20 divisors, 360 — 24 divisors, 720 — 30 divisors, 840 — 32 divisors, 1,260 — 36 divisors, 1,680 — 40 divisors, 2,520 — 48 divisors, 5,040 — 60 divisors, 7,560 — 64 divisors, 10,080 — 72 divisors, 15,120 — 80 divisors, 20,160 — 84 divisors, 25,200 — 90 divisors, 27,720 — 96 divisors, 45,360 — 100 divisors, 50,400 — 108 divisors, 55,440 — 120 divisors, 83,160 — 128 divisors, 110,880 — 144 divisors, 166,320 — 160 divisors, 221,760 — 168 divisors, 277,200 — 180 divisors, 332,640 — 192 divisors, 498,960 — 200 divisors, 554,400 — 216 divisors, 665,280 — 224 divisors, 720,720 — 240 divisors, 1,081,080 — 256 divisors, 1,441,440 — 288 divisors, 2,162,160 — 320 divisors, 2,882,880 — 336 divisors, 3,603,600 — 360 divisors, 4,324,320 — 384 divisors, 6,486,480 — 400 divisors, 7,207,200 — 432 divisors, 8,648,640 — 448 divisors, 10,810,800 — 480 divisors, 14,414,400 — 504 divisors, 17,297,280 — 512 divisors

Artykuł z tłem historycznym poniżej nie został jeszcze przetłumaczony i jest wyświetlany po angielsku.

O liczby wysoce złożone

The name comes from Srinivasa Ramanujan, who devoted a long paper in the Proceedings of the London Mathematical Society in 1915 to numbers he called highly composite — those with more divisors than any smaller number. He had arrived at Trinity College, Cambridge, the previous year at G. H. Hardy's invitation, and the paper is one of the first substantial pieces of work he published from England. In it he proved the structure theorem that still underpins every efficient search: the prime factorisation of a highly composite number uses consecutive primes starting at 2, and the exponents never increase as the primes get larger. He also introduced a sparser subfamily, the superior highly composite numbers, as a tool for pinning down how fast the divisor count can grow.

The published paper was not the whole manuscript. Wartime paper shortages forced the Proceedings to cut it, and the remaining sections sat unpublished for decades until Jean-Louis Nicolas and Guy Robin edited and annotated them for The Ramanujan Journal in 1997.

Interest in such numbers long predates the terminology. In Book V of the Laws, Plato proposes 5040 as the number of landholders in his ideal city, specifically because of how many ways it divides — and 5040 is indeed highly composite, with 60 divisors. Whether Plato grasped the record-setting property or simply liked a convenient number is not settled; the mathematician Jean-Pierre Kahane suggested the former, but it remains a conjecture about Plato's intent rather than a documented claim.

The modern asymptotic picture begins with Paul Erdős, who showed in 1944 that the count of highly composite numbers below x grows at least as fast as a power of log x strictly greater than one. Nicolas and Robin extended that line of work through the 1970s and 1980s.

Najważniejsze właściwości

  • n is highly composite when d(n) > d(m) for every m < n. The sequence begins 1, 2, 4, 6, 12, 24, 36, 48, 60, 120.
  • Every term greater than 1 factors over consecutive primes starting at 2, with non-increasing exponents: 2^a₁ · 3^a₂ · … · p^aₖ where a₁ ≥ a₂ ≥ … ≥ aₖ ≥ 1.
  • That final exponent aₖ equals 1 for every highly composite number except two: 4 = 2² and 36 = 2²·3².
  • 1 is the only odd term, and 1, 4 and 36 are the only perfect squares in the whole sequence.
  • Every term greater than 6 is abundant — its divisors excluding itself add up to more than the number.
  • 720720 is the smallest number with 240 divisors, and nothing below one million has more.
  • The 136th term, 10,108,248,702,552,000, is the first to exceed 2⁵³−1, so this page computes with arbitrary-precision integers.
  • There are infinitely many, since d(n) is unbounded; Erdős proved in 1944 that the number of them below x exceeds (log x)^(1+c) for some c > 0.

Inne długości

Źródła