Properties of the Number 506

Five Hundred Six

Basics

Value: 505 → 506 → 507

Parity: even

Prime: No

Previous Prime: 503

Next Prime: 509

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 11 × 23

Divisors: 1, 2, 11, 22, 23, 46, 253, 506

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 111111010

Octal: 772

Duodecimal: 362

Hexadecimal: 1fa

Square: 256036

Square Root: 22.494443758403985

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1). A2378

Square pyramidal numbers: a(n) = 0² + 1² + 2² + ... + n² = n*(n+1)*(2·n+1)/6. A330

Quarter-squares: a(n) = floor(n/2)*ceiling(n/2). Equivalently, a(n) = floor(n²/4). A2620

Number of integer partitions of n with distinct differences between successive parts. A325325

a(n) = n*φ(n). A2618

a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n. A6918

Sum of positive integers in smallest positive reduced residue system modulo n. a(1) = 1 by convention. A23896

Triangle read by rows: T(n,k) is number of partitions of n with Durfee square of size k (n>=1; 1<=k<=floor(sqrt(n))). A115994

Number of dissections of a polygon: binomial(6n,n)/(5n+1). A2295

Multiples of 11. A8593