Properties of the Number 9612

Nine Thousand Six Hundred Twelve

Basics

Value: 9611 → 9612 → 9613

Parity: even

Prime: No

Previous Prime: 9601

Next Prime: 9613

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 89

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 27, 36

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010110001100

Octal: 22614

Duodecimal: 5690

Hexadecimal: 258c

Square: 92390544

Square Root: 98.04080783020915

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 points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n² + 2. Also coordination sequence for f.c.c. or A₃ or D₃ lattice. A5901

Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is the number of n-colorings of the square grid graph G_k,k. A182406

Number A(n,k) of tilings of a k X n rectangle using dominoes and straight (3 X 1) trominoes; square array A(n,k), n>=0, k>=0, read by antidiagonals. A219866

Numbers divisible by the sum and product of their digits. A38186

T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once. A269201

Triangle, read by rows, such that the convolution of each row with {1,2} produces a triangle which, when flattened, equals this flattened form of the original triangle. A92686

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions. A187162

T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal. A233917

First column and main diagonal of triangle A092686, in which the convolution of each row with {1,2} produces a triangle that, when flattened, equals the flattened form of A092686. A92687