Properties of the Number 67104

Sixty-Seven Thousand One Hundred Four

Basics

Value: 67103 → 67104 → 67105

Parity: even

Prime: No

Previous Prime: 67103

Next Prime: 67121

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 233

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000011000100000

Octal: 203040

Duodecimal: 32A00

Hexadecimal: 10620

Square: 4502946816

Square Root: 259.04439773907484

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

Constant term in the reduction by (x² -> x+1) of the polynomial p(n,x) given in Comments. A192872

Number of perfect matchings on an n X n L-shaped graph. A79472

T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once. A269035

G.f. A(x) satisfies: R(x²*A(x)) = x³ - x⁴, where R(A(x)) = x. A350433

a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4. A293411

Row sums of a characteristic triangle for the Fibonacci numbers. A110034

Denominators a(n) of Pythagorean approximations b(n)/a(n) to 1/2. A195547

Triangle read by rows: T(n,k) is the number of unlabeled weakly connected oriented graphs with n arcs and k vertices, k = 1..n+1. A350914

Number of derangements of [n] avoiding the patterns 123, 132 and 213. A114215

Number of n X 3 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once. A269030