Properties of the Number 89256

Eighty-Nine Thousand Two Hundred Fifty-Six

Basics

Value: 89255 → 89256 → 89257

Parity: even

Prime: No

Previous Prime: 89237

Next Prime: 89261

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 3719

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 3719, 7438

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101110010101000

Octal: 256250

Duodecimal: 437A0

Hexadecimal: 15ca8

Square: 7966633536

Square Root: 298.75742668593193

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

O.g.f.: ∑_n>=0 -nⁿ*(n-1)^n-1 * exp(-n*(n-1)*x) * xⁿ / n!. A217905

Lower (1/3,1/2)-midsequence of ((2ⁿ)) and ((3ⁿ)); see Comments. A389123

Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]). A274105

Number of ways to place n nonattacking bishops on black squares of a 2n X 2n board. A191236

Sequence is {a(6,n)}, where a(m,n) is defined at sequence A110665. A110671

Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n). A88960

Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]). A274106

Binomial transform of (Jacobsthal(n) + 2ⁿ*Jacobsthal(-n))/2. A94039

a(n) = (1/6)*(3ⁿ + (-2)ⁿ - 1). A344747

Numbers n such that decimal expansion of n² has the form D 0 (D+1) for some number D. A89256