Perfect Cubes

Complete list of perfect cube numbers up to 1,000,000

0 1 8 27 64 125 216 343 512 729 1000 1331 1728 2197 2744 3375 4096 4913 5832 6859 8000 9261 10648 12167 13824 15625 17576 19683 21952 24389 27000 29791 32768 35937 39304 42875 46656 50653 54872 59319 64000 68921 74088 79507 85184 91125 97336 103823 110592 117649 125000 132651 140608 148877 157464 166375 175616 185193 195112 205379 216000 226981 238328 250047 262144 274625 287496 300763 314432 328509 343000 357911 373248 389017 405224 421875 438976 456533 474552 493039 512000 531441 551368 571787 592704 614125 636056 658503 681472 704969 729000 753571 778688 804357 830584 857375 884736 912673 941192 970299 1000000

What are Perfect Cubes?

A perfect cube (or cube number) is an integer that can be expressed as the cube of another integer. In other words, n is a perfect cube if n = k³ for some integer k. The first perfect cubes are: 0, 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000.

Unlike perfect squares, perfect cubes can be negative: (−2)³ = −8, (−3)³ = −27. This is because an odd power of a negative number remains negative. Perfect cubes grow much faster than perfect squares — the 10th perfect cube is 1000, while the 10th perfect square is only 100.

Properties of Perfect Cubes

Every perfect cube is the sum of consecutive odd numbers. Specifically, n³ = (n²−n+1) + (n²−n+3) + ... + (n²+n−1). For example: 8 = 2³ = 3 + 5, 27 = 3³ = 7 + 9 + 11, 64 = 4³ = 13 + 15 + 17 + 19.

The digital root of a perfect cube cycles through the pattern 1, 8, 9, 1, 8, 9... A perfect cube modulo 9 is always congruent to 0, 1, or 8. Perfect cubes can end in any digit from 0 to 9, unlike perfect squares which can only end in 0, 1, 4, 5, 6, or 9.

Geometric Interpretation

The name "cube" comes from geometry: a perfect cube represents the volume of a cube with integer edge length. 27 = 3³ is the volume of a 3×3×3 cube, 64 = 4³ is the volume of a 4×4×4 cube. This three-dimensional interpretation makes cubes fundamental in solid geometry and spatial reasoning.

Fermat's Last Theorem and Cubes

Fermat's Last Theorem (proved by Andrew Wiles in 1995) states that no three positive integers a, b, c can satisfy an + bn = cn for any integer n > 2. For cubes specifically, there is no solution to a³ + b³ = c³. However, a number can be the sum of two cubes: 9 = 1³ + 2³, 72 = 2³ + 4³. The famous taxicab numbers are the smallest numbers expressible as the sum of two cubes in multiple ways — the most famous is 1729 = 1³ + 12³ = 9³ + 10³ (the Hardy-Ramanujan number).

Sum of Cubes

The sum of the first n perfect cubes equals the square of the n-th triangular number: 1³ + 2³ + 3³ + ... + n³ = (n(n+1)/2)². This is known as Nicomachus's theorem. For example: 1³ + 2³ + 3³ = 1 + 8 + 27 = 36 = 6² = (3×4/2)². This elegant identity connects cubes to both squares and triangular numbers.

Applications

Perfect cubes appear in physics (volume calculations, cubic crystal structures), chemistry (cubic close-packing of atoms), and computer science (cubic algorithms O(n³), 3D array indexing). The cube root function is essential in engineering for calculating dimensions from volumes.