Properties of the Number 94432

Ninety-Four Thousand Four Hundred Thirty-Two

Basics

Value: 94431 → 94432 → 94433

Parity: even

Prime: No

Previous Prime: 94427

Next Prime: 94433

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 13 × 227

Divisors: 1, 2, 4, 8, 13, 16, 26, 32, 52, 104

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111000011100000

Octal: 270340

Duodecimal: 46794

Hexadecimal: 170e0

Square: 8917402624

Square Root: 307.29790106670106

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

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234658

Irregular triangle, T(n, k) = coefficients of p(x, n), where p(x, n) = (1-2·x)ⁿ⁺¹ * ∑_j>=0 jⁿ*(x/(1-x))^j, read by rows. A142073

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 (constant-stress 1 X 1 tilings). A234653

Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234654

Triangle read by rows, T(n, k) = ∑_j=0..n (-1)^k-j*Eulerian1(n, j)* binomial(n-j, n-k) for 0 <= k <= n. A291977

a(n) = rightmost term in Mⁿ * [1 0 0]. M = the 3 X 3 stiffness matrix [1 -1 0 / -1 4 -3 / 0 -3 3]. A94432