Properties of the Number 10496

Ten Thousand Four Hundred Ninety-Six

Basics

Value: 10495 → 10496 → 10497

Parity: even

Prime: No

Previous Prime: 10487

Next Prime: 10499

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁸ × 41

Divisors: 1, 2, 4, 8, 16, 32, 41, 64, 82, 128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100100000000

Octal: 24400

Duodecimal: 60A8

Hexadecimal: 2900

Square: 110166016

Square Root: 102.44998779892558

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

Products of the 8th power of a prime and a distinct prime (p⁸*q). A179668

Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 7. A195091

T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs). A233174

a(n) = T(n,3), array T as in A049600. A49612

a(n) = Index k where A227183(k) for the first time gets value n; the runlength binary code for minimally runlength-encoded unordered partition of size n. A227368

Positive numbers of the form x⁴ - 6·x² * y² + y⁴ (where x,y are integers). A135789

T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock traces. A186939

T(n,k)=4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223415

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum unequal to its neighbors horizontally and vertically. A253367

Number of ordered pairs of disjoint strict integer partitions of n. A365662