Properties of the Number 53105

Fifty-Three Thousand One Hundred Five

Basics

Value: 53104 → 53105 → 53106

Parity: odd

Prime: No

Previous Prime: 53101

Next Prime: 53113

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 13 × 19 × 43

Divisors: 1, 5, 13, 19, 43, 65, 95, 215, 247, 559

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111101110001

Octal: 147561

Duodecimal: 26895

Hexadecimal: cf71

Square: 2820141025

Square Root: 230.4452212565928

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(n-2)². A1042

Row 3 of array in A047666. A47667

Monotonic ordering of set S generated by these rules: if·and y are in S and x²-y²>0 then x²-y² is in S, and 2 and 3 are in S. A192648

Nodes of tree generated as follows: (1,2) is an edge, and if (x,y) is an edge, then (y, y² - x²) and (y, y² + x²) are edges. A228940

Number of length 5 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean. A244836

Number of length 1+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four. A249657

Irregular triangle read by rows: T(n,k) is the coefficient of x^k in the domination polynomial of the n X n torus grid graph (n>=1, A094087(n)<=k<=n²). A378418

T(n,k) = Number of length n 0..k arrays with each partial sum starting from the beginning no more than two standard deviations from its mean. A244832

a(n) = ((7·n+9)(!⁷))/9(!⁷), related to A034829 (((7·n+2)(!⁷))/2 sept-, or 7-factorials). A53105