• 512 can be written using four 4's:

512 has 10 divisors (see below), whose sum is σ = 1023. Its totient is φ = 256.

The previous prime is 509. The next prime is 521. The reversal of 512 is 215.

The cubic root of 512 is 8.

It is a perfect power (a cube, a 9-th power), and thus also a powerful number.

It is a Jordan-Polya number, since it can be written as (2!)^{9}.

512 is nontrivially palindromic in base 7 and base 15.

It can be written as a sum of positive squares in only one way, i.e., 256 + 256 = 16^2 + 16^2 .

It is an ABA number since it can be written as A⋅B^{A}, here for A=2, B=16.

It is a Harshad number since it is a multiple of its sum of digits (8).

It is a Leyland number of the form 4^{4} + 4^{4}.

It is a magnanimous number.

It is a Duffinian number.

512 is an undulating number in base 15.

Its product of digits (10) is a multiple of the sum of its prime divisors (2).

It is a plaindrome in base 12 and base 14.

It is a nialpdrome in base 2, base 4, base 8 and base 16.

It is a self number, because there is not a number *n* which added to its sum of digits gives 512.

It is an unprimeable number.

In principle, a polygon with 512 sides can be constructed with ruler and compass.

It is an impolite number, since it cannot be written as a nontrivial sum of consecutive naturals.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 512

512 is a deficient number, since it is larger than the sum of its proper divisors (511).

512 is an frugal number, since it uses more digits than its factorization.

512 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 18 (or 2 counting only the distinct ones).

The product of its digits is 10, while the sum is 8.

The square root of 512 is about 22.6274169980.

Adding to 512 its reverse (215), we get a palindrome (727).

The spelling of 512 in words is "five hundred twelve", and thus it is an aban number and an oban number.

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •