Properties of the Number 91656

Ninety-One Thousand Six Hundred Fifty-Six

Basics

Value: 91655 → 91656 → 91657

Parity: even

Prime: No

Previous Prime: 91639

Next Prime: 91673

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 19 × 67

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110011000001000

Octal: 263010

Duodecimal: 45060

Hexadecimal: 16608

Square: 8400822336

Square Root: 302.74741947702876

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

Place n points in general position on each side of a square, and join every pair of the 4·n+4 boundary points by a chord; sequence gives number of edges in the resulting planar graph. A367122

Structured disdyakis dodecahedral numbers (vertex structure 7). A100162

Increasing gaps in A038593 (lower terms). A93342

Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence of fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225200

Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence s(n) of the sum resp. product of generalized fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225201

G.f. A(x) satisfies the condition that both A(x) and F(x) = A(x·F(x)²) have zeros for every other coefficient after initial terms; g.f. of dual sequence A157305 satisfies the same condition. A157302

The 5th iteration of x·C(x) where C(x) is the Catalan function (A000108). A158828

Least number k such that the continued fraction expansion of H(k) contains the numbers 1, 2, ..., n, where H(k) is the k-th Harmonic number. A91656

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of edges in the resulting planar graph. A367190

Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. A207464