Properties of the Number 56622

Fifty-Six Thousand Six Hundred Twenty-Two

Basics

Value: 56621 → 56622 → 56623

Parity: even

Prime: No

Previous Prime: 56611

Next Prime: 56629

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 9437

Divisors: 1, 2, 3, 6, 9437, 18874, 28311, 56622

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101110100101110

Octal: 156456

Duodecimal: 28926

Hexadecimal: dd2e

Square: 3206050884

Square Root: 237.95377702402624

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) = a(n-1)+a(m), where m=2n-2-2^p+1 and 2^p<n-1<=2^p+1, for n >= 4. A50071

Number of weak peaks in all Motzkin paths of length n. A weak peak of a Motzkin path is a vertex on the top of a hump. A hump is an upstep followed by 0 or more flatsteps followed by a downstep. For example, the Motzkin path u·duu·h*h·dd, where u=(1,1), h=(1,0), d(1,-1), has 4 weak peaks (shown by the stars). A247287

Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below. A78612

a(n) = A000188(n)/A055229(n). A56622

Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon. A367665