Properties of the Number 13443

Thirteen Thousand Four Hundred Forty-Three

Basics

Value: 13442 → 13443 → 13444

Parity: odd

Prime: No

Previous Prime: 13441

Next Prime: 13451

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 4481

Divisors: 1, 3, 4481, 13443

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010000011

Octal: 32203

Duodecimal: 7943

Hexadecimal: 3483

Square: 180714249

Square Root: 115.94395197680645

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

Number of preferential arrangements of n labeled elements when at least k=5 elements per rank are required. A245790

Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1. A96025

Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=3. A120577

Expansion of ∏_m>=1 (1+x^m)¹⁵. A22580

a(n) = floor((1 + 2ⁿ)/(1 + 2·n)). A191633

Coefficient of·in minimal polynomial of the continued fraction [1ⁿ,1/3,1,1,1,...], where 1ⁿ means n ones. A266702

Number of square plane partitions of n with strictly decreasing rows and columns. A323530

a(n) = ∑_{k=0..floor(n/2)} binomial(3·n+k-1,k) * binomial(3·n+k,n-2·k). A379086

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384809. A384811

Number of rooted non-separable Eulerian planar maps with n edges. A69728