Properties of the Number 51570

Fifty-One Thousand Five Hundred Seventy

Basics

Value: 51569 → 51570 → 51571

Parity: even

Prime: No

Previous Prime: 51563

Next Prime: 51577

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 5 × 191

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100100101110010

Octal: 144562

Duodecimal: 25A16

Hexadecimal: c972

Square: 2659464900

Square Root: 227.09029041330675

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

T(n,k)=Number of length n+4 0..k arrays with no consecutive five elements summing to more than 2·k. A241936

Triangle read by rows: T(n,k) is the number of parking functions of length n whose maximum element is k, where n >= 0 and 0 <= k <= n. A260693

Number of parking functions of length 2n whose maximum element is n. A291121

Expansion of ∏_k>0 (1+sqrt(1-4·x^k))/2. A309867

Numbers k such that k | sigma₁₃(k) - φ(k)¹³. A55707

Number of 4 X 4 X 4 triangular 0..n arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value. A215184

Number of length n+4 0..7 arrays with no consecutive five elements summing to more than 2·7. A241935

Number of length 2+4 0..n arrays with no consecutive five elements summing to more than 2·n. A241938

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, 1)}. A150794

Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value. A51570