Properties of the Number 13355

Thirteen Thousand Three Hundred Fifty-Five

Basics

Value: 13354 → 13355 → 13356

Parity: odd

Prime: No

Previous Prime: 13339

Next Prime: 13367

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 2671

Divisors: 1, 5, 2671, 13355

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010000101011

Octal: 32053

Duodecimal: 788B

Hexadecimal: 342b

Square: 178356025

Square Root: 115.56383517346592

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

Augmentation of the triangular array A158405. See Comments. A193091

Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 5·x + 2·x²)/(1 - 2·x - 11·x² - 6·x³). A179597

Number of magic labelings of the prism graph I X C₅ with magic sum n. A244497

Numbers k such that numerator(Bernoulli(2·k)/(2·k)) is different from numerator(Bernoulli(2·k)/(2·k*(2·k-1))). A90495

Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2·m)/(2·m)) / numerator(Bernoulli(2·m)/(2·m*(2·m-1))) equals p. A92291

a(n) = a(n-1) + a(n-2) + a([n/3]), where a(0) = 1, a(1) = 2, a(2) = 3. A298341

Representation of n = sum_k b_k*(k!!) in the double-factorial base by some b_k-fold concatenation of the indices k. A181521

Engel expansion of ζ(9)=sum(i>0,1/i⁹). A67917

Rectangular array read by antidiagonals: A(n,k) = number of magic labelings of the graph LOOP X C_n (see comments) having magic sum k, n >= 1, k >= 0. A293311

Rectangular array read by antidiagonals: A(n,k) = tr((M_n)^k), k >= 0, where M_n is the n X n matrix M₁ = {{1}}, M_n = {{0,...,0,1},{0,...,0,1,1},...,{0,1,...,1},{1,...,1}}, n > 1, and tr(.) is the trace. A293312