Properties of the Number 65169

Sixty-Five Thousand One Hundred Sixty-Nine

Basics

Value: 65168 → 65169 → 65170

Parity: odd

Prime: No

Previous Prime: 65167

Next Prime: 65171

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 557

Divisors: 1, 3, 9, 13, 39, 117, 557, 1671, 5013, 7241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111010010001

Octal: 177221

Duodecimal: 31869

Hexadecimal: fe91

Square: 4246998561

Square Root: 255.28219679405768

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

Array read by antidiagonals: T(n,k) = number of nonequivalent dissections of a polygon into n k-gons by nonintersecting diagonals up to rotation (k >= 3). A295224

Traces of the matrices (A345197) counting integer compositions by length and alternating sum. A345908

Number of nonequivalent dissections of a polygon into n quadrilaterals by nonintersecting diagonals up to rotation. A5034

Number of nonequivalent noncrossing trees with n edges up to rotation and reflection. A296533

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x+2k)^k for 0 <= k <= n . A248829

a(n) = smallest number k > a(n-1) maximizing the number of primes in all sums a(j)+k, j=1..(n-1), with a(1)=2. A291163

Permutation t->t-2 of Z, folded to N. A65169