Properties of the Number 13604

Thirteen Thousand Six Hundred Four

Basics

Value: 13603 → 13604 → 13605

Parity: even

Prime: No

Previous Prime: 13597

Next Prime: 13613

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 19 × 179

Divisors: 1, 2, 4, 19, 38, 76, 179, 358, 716, 3401

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11010100100100

Octal: 32444

Duodecimal: 7A58

Hexadecimal: 3524

Square: 185068816

Square Root: 116.63618649458667

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

Standard composition numbers of compositions whose maximal runs all belong to {(1), (2,2), (3,3,3), ...}. A389530

Numbers k such that k² is palindromic in base 15. A30073

Triangle read by rows: the almost-Riordan array ( 1/(1-x) | 2/((1-x)*(1+x+sqrt(5·x²-6·x+1))), (1-3·x-sqrt(5·x²-6·x+1))/(2x) ). A373746

a(0)=1, for n>0: a(n) = 4·9^n-1 - (1/2)*∑_i=1..n-1 a(i)*a(n-i). A85363

Numbers m such that the decimal number concat(8,m) is a square. A273363

Expansion of (η(q²)η(q⁶)/(η(q)η(q³)))⁶ in powers of q. A123653

Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3·n/2) <= k <= n*(n-1)/2). A339072

Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists. A344072

Expansion of q / (χ(q) * χ(q³))⁶ in powers of q where χ() is a Ramanujan θ function. A107653

Number of magic labelings of the graph LOOP X C₉ (see comments) having magic sum n, n >= 0. A293310