# 256

$t_title is "256"

$t_adjust_path is "/~caldwell/curios/"

$t_class is "composite"

$short is "256"

$nunber_id is "522"

$t_meta['description'] is "One of many pages of prime number
curiosities and trivia. This page discusses 256
Come explore a new prime today!"

Erdös has conjectured that no higher power of the first prime (i.e., 2^{8} = 256) is a sum of distinct powers of 3.

256 = (21701 - 19937) - (23209 - 21701). Note the use of three consecutive Mersenne prime exponents! [Noll]

256 = (2^2^2)^2 is the smallest prime power of a prime power of a prime power of a prime.

Printed from the PrimePages <primes.utm.edu> © G. L. Honaker and Chris K. Caldwell