Properties of the Number 91959

Ninety-One Thousand Nine Hundred Fifty-Nine

Basics

Value: 91958 → 91959 → 91960

Parity: odd

Prime: No

Previous Prime: 91957

Next Prime: 91961

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 29 × 151

Divisors: 1, 3, 7, 21, 29, 87, 151, 203, 453, 609

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110011100110111

Octal: 263467

Duodecimal: 45273

Hexadecimal: 16737

Square: 8456457681

Square Root: 303.2474237318431

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

Expansion of g.f. A(x) satisfying ∑_n=-oo..+oo (xⁿ - 10·A(x))ⁿ = 1 - 8*∑_n>=1 x^n². A370043

Convolved Fibonacci numbers. A1874

a(n) = max T(n,k), with T as in A037027. A38149

Sixth column (m=5) of triangle A060920 (bisection of Fibonacci triangle, even part). A61181

Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts. A262494

Table in which the g.f. of row n, R(n,x), satisfies ∑_k=-oo..+oo (x^k - n·R(n,x))^k = 1 - (n-2)*∑_k>=1 x^k², for n >= 1, as read by antidiagonals. A370030

Bisection of Fibonacci triangle A037027: even-indexed members of column sequences of A037027 (not counting leading zeros). A60920

Number of (n+1) X (3+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235093

a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2·a(2n)+1. A91959