Properties of the Number 55692

Fifty-Five Thousand Six Hundred Ninety-Two

Basics

Value: 55691 → 55692 → 55693

Parity: even

Prime: No

Previous Prime: 55691

Next Prime: 55697

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 × 13 × 17

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 13, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101100110001100

Octal: 154614

Duodecimal: 28290

Hexadecimal: d98c

Square: 3101598864

Square Root: 235.99152527156562

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

Number T(n,k) of length 2n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A256117

Number of compositions of n avoiding the pattern (2,1,2). A335473

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x+289)² = y². A207059

Numbers that are the sum of four third powers in exactly eight ways. A345153

Partial sums of A034263. A51947

a(n) = (2ⁿ/n!)*∏_k=0..n-1 (4·k + 5). A4985

G.f.: 1/((1-x)*(1-x²))⁶. A38166

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k peaks (i.e., ud and Ud's). A108425

Triangle, read by rows of 2·n+1 terms, where row n lists the coefficients in (1+3·x+2·x²)ⁿ. A200536

Expansion of 1 / ((1 - x)⁷*(1 + x)⁴). A299336