Properties of the Number 13452

Thirteen Thousand Four Hundred Fifty-Two

Basics

Value: 13451 → 13452 → 13453

Parity: even

Prime: No

Previous Prime: 13451

Next Prime: 13457

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 19 × 59

Divisors: 1, 2, 3, 4, 6, 12, 19, 38, 57, 59

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11010010001100

Octal: 32214

Duodecimal: 7950

Hexadecimal: 348c

Square: 180956304

Square Root: 115.98275733918383

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

Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees. A57123

Number of ways to split a strict integer partition of n into consecutive subsequences with weakly decreasing sums. A319794

Define E(n) = ∑_{k >= 0} (-1)^floor(k/3)*kⁿ/k! for n = 0,1,2,... . Then E(n) is an integral linear combination of E(0), E(1) and E(2). This sequence lists the coefficients of E(0). A143628

T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 antidiagonally or horizontally. A189064

Triangle, read by rows, T(n,k) = (7·n-7·k+1)*T(n-1, k-2) + (7·k-6)*T(n-1, k) + 7·T(n-2, k-1) with T(n, 1) = T(n, n) = 1. A144445

Permutations of 12345: Numbers having each of the decimal digits 1,...,5 exactly once, and no other digit. A178475

a(n) = C(2,n) δ C(0,n). A147721

a(n) = 16·n² - 4. A158443

Antidiagonal sums of the convolution array A213765. A213767

Positions of -2's in A346242. A354822