Properties of the Number 56660

Fifty-Six Thousand Six Hundred Sixty

Basics

Value: 56659 → 56660 → 56661

Parity: even

Prime: No

Previous Prime: 56659

Next Prime: 56663

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 2833

Divisors: 1, 2, 4, 5, 10, 20, 2833, 5666, 11332, 14165

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101110101010100

Octal: 156524

Duodecimal: 28958

Hexadecimal: dd54

Square: 3210355600

Square Root: 238.03361107205006

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

a(n+1) = n·a(n) + a(n-1) with a(0)=1, a(1)=0. A1053

Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0, 1, 1, 3, 10, 43, 225, 1393, 9976, 81201, ... Then S(0), S(1), S(2), ... are written vertically, next to each other, with the initial term of each on the next row down. A102472

Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0,1,1,3,10,43,225,1393,9976,81201, ... Then S(0), S(1), S(2), ... are written next to each other, vertically, with the initial term of each on the next row down. The order of the terms in the rows are then reversed. A102473

Triangle with a(n,n)=1, a(n,k)=(n-1)*a(n-1,k)+a(n-2,k) for n>k. A62323

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121554

T(n,m) = (1/m!)*∑_i=0..m stirling1(m,i)*(2ⁱ)*(2ⁱ+1)*...*(2ⁱ+n-1). A59587

Array t(n, k) = (k*(n-1) +2-k)*t(n-1, k) + k·t(n-2, k), with t(1, k) = 1, t(2, k) = 2, read by antidiagonals. A144446

Numerator of Hermite(n, 5/31). A160303

T(n,k) = 2*(K(n,2)*I(k,2) - (-1)^n+k*I(n,2)*K(k,2)), where I(n,x) and K(n,x) are Bessel functions; triangle read by rows for 0 <= k <= n. A246654

Antidiagonal triangle sequence based on recursion: f(n,a)=a·n*f(n-1,a)+f(n-2,a). A173003