Properties of the Number 9496

Nine Thousand Four Hundred Ninety-Six

Basics

Value: 9495 → 9496 → 9497

Parity: even

Prime: No

Previous Prime: 9491

Next Prime: 9497

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 1187

Divisors: 1, 2, 4, 8, 1187, 2374, 4748, 9496

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10010100011000

Octal: 22430

Duodecimal: 55B4

Hexadecimal: 2518

Square: 90174016

Square Root: 97.44742172063866

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

Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells. A85

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}. A79955

a(n) = a(n-1) + a(n-5); a(0) = ... = a(4) = 1. A3520

Coordination sequence for "tcd" 3D uniform tiling. A299287

Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals. A8307

Number T(n,k) of solid standard Young tableaux of n cells and height = k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A214753

Number A(n,k) of solid standard Young tableaux of n cells and height <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A215086

Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows. A293815

T(n,k) = Number of (n·k) X k binary arrays with rows in nonincreasing order, n ones in every column and no more than 2 ones in any row. A188403

Number T(n,k) of multisets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293808