Properties of the Number 13317

Thirteen Thousand Three Hundred Seventeen

Basics

Value: 13316 → 13317 → 13318

Parity: odd

Prime: No

Previous Prime: 13313

Next Prime: 13327

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 193

Divisors: 1, 3, 23, 69, 193, 579, 4439, 13317

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010000000101

Octal: 32005

Duodecimal: 7859

Hexadecimal: 3405

Square: 177342489

Square Root: 115.39930675701653

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

Squarefree n such that the elliptic curve n·y² = x³ - x arising in the "congruent number" problem has rank 3. A62693

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 291", based on the 5-celled von Neumann neighborhood. A280567

Concatenation of n³ and 7. A61679

G.f. A(x) = ∑_n>=0 a(n)*xⁿ satisfies: [∑_n>=0 xⁿ/(1 - xⁿ⁺¹)]³ = ∑_n>=0 a(n)*xⁿ/(1 - xⁿ⁺¹)³. A341374

Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number. A118559

a(n) is the sum of the lengths of all the segments used to draw a rectangle of height partition(n) and width n divided into partition(n) rectangles of unit height, in turn, divided into rectangles of unit height and lengths corresponding to the parts of the partitions of n. A338969

The number of integers k < 10ⁿ such that both k and k³ mod 10ⁿ have all odd decimal digits. A182211

Triangular array read by rows: T(n,k) is the number of binary relations on [n] that are dense (A355730) and have exactly k strongly connected components, n>=0, 0<=k<=n. A365985

Numbers k such that k, k+1 and k+2 are sums of 2 squares. A82982

Expansion of e.g.f.: tanh(exp(x) - cos(x)) = x + (2/2!)*x² - (1/3!)*x³ - (24/4!)*x⁴ - (123/5!)*x⁵ + ... A13317