Properties of the Number 55641

Fifty-Five Thousand Six Hundred Forty-One

Basics

Value: 55640 → 55641 → 55642

Parity: odd

Prime: No

Previous Prime: 55639

Next Prime: 55661

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 17 × 1091

Divisors: 1, 3, 17, 51, 1091, 3273, 18547, 55641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101100101011001

Octal: 154531

Duodecimal: 28249

Hexadecimal: d959

Square: 3095920881

Square Root: 235.8834457947399

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

O.g.f. satisfies: A(x) = ∑_n>=0 n^2·n * xⁿ * A(x)ⁿ / n! * exp(-n²*x·A(x)). A219184

G.f. A(x) satisfies: A(x) = (1 + x) * A(x²)²*A(x³)³*A(x⁴)⁴* ... *A(x^k)^k* ... A307605

a(n) = n*(1 + n)*(3 - 4·n + 4·n²)/6. A213840

a(n) is the least integer k such that k/Fibonacci(n) > π. A293678

a(n) is the integer k that minimizes |k/Fibonacci(n) - π|. A293679

Number of series-reduced locally non-intersecting aperiodic rooted trees with n nodes. A319271

Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1. A269642

Number of zero digits in n. A55641

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1. A269640