Properties of the Number 15354

Fifteen Thousand Three Hundred Fifty-Four

Basics

Value: 15353 → 15354 → 15355

Parity: even

Prime: No

Previous Prime: 15349

Next Prime: 15359

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 853

Divisors: 1, 2, 3, 6, 9, 18, 853, 1706, 2559, 5118

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101111111010

Octal: 35772

Duodecimal: 8A76

Hexadecimal: 3bfa

Square: 235745316

Square Root: 123.9112585683803

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 nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. A232376

T(n,k)=Number of (n+4)X(k+4) 0..2 matrices with each 5X5 subblock idempotent. A224625

a(n) = A276085(A108951(A346096(n))), where A346096(n) gives the numerator of the primorial deflation of A276086(A108951(n)). A346108

a(n) = A276085(A108951(A346097(n))), where A346097(n) gives the denominator of the primorial deflation of A276086(A108951(n)). A346109

Number of possible sets {{row sums}, {column sums}} of a 2n X 2n matrix with entries from {0,1,-1} and all row and column sums distinct. A49526

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k returns to the horizontal axis (both from above and below). The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182898

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 0,3,2,1,4 for x=0,1,2,3,4. A196072

Number of (n+4)X(n+4) 0..2 matrices with each 5X5 subblock idempotent. A224617

Number of (n+4)X6 0..2 matrices with each 5X5 subblock idempotent. A224619

Number of n X 2 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. A232370