Properties of the Number 32456

Thirty-Two Thousand Four Hundred Fifty-Six

Basics

Value: 32455 → 32456 → 32457

Parity: even

Prime: No

Previous Prime: 32443

Next Prime: 32467

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 4057

Divisors: 1, 2, 4, 8, 4057, 8114, 16228, 32456

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111011001000

Octal: 77310

Duodecimal: 16948

Hexadecimal: 7ec8

Square: 1053391936

Square Root: 180.15548839821673

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)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock trace equal to any horizontal or vertical neighbor 2X2 subblock trace. A185769

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222360

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 6 (6 maximizes T(1,1)). A233682

Number of (n+1) X 3 binary arrays with no 2 X 2 subblock trace equal to any horizontal or vertical neighbor 2 X 2 subblock trace. A185762

Number of (n+1)X8 binary arrays with no 2X2 subblock trace equal to any horizontal or vertical neighbor 2X2 subblock trace. A185767

Number of nX5 0..1 arrays with no more than floor(nX5/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222357

Number of nX7 0..1 arrays with no more than floor(nX7/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222359

Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 6. A233675

Number of (n+1) X (6+1) 0..3 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 6. A233680

The number of possible values that can be obtained for the Shannon diversity index across all partitions of n. A383683