Properties of the Number 13429

Thirteen Thousand Four Hundred Twenty-Nine

Basics

Value: 13428 → 13429 → 13430

Parity: odd

Prime: No

Previous Prime: 13421

Next Prime: 13441

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 1033

Divisors: 1, 13, 1033, 13429

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010001110101

Octal: 32165

Duodecimal: 7931

Hexadecimal: 3475

Square: 180338041

Square Root: 115.88356225108029

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 sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of two m-gonal polygonal components chained with string components of length 3 as m varies. A152934

Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1). A259862

Number of simple unlabeled n-node graphs of connectivity 4. A52445

Number of triangular polyominoes (or polyiamonds) [A000577] with perimeter n. A57729

Number of partitions of n such that the number of parts is divisible by the smallest part. A168657

Define C(n) by the recursion C(0) = 3·i where i² = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 3*(-1)ⁿ/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z. A69960

Number T(n,k) of elements k in all n X n Tesler matrices of nonnegative integers; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A259841

Expansion of ∏_{i>0, j>0, k>0} 1/(1 - x^{i² + j² + k²}). A321433

Number of different positions in which a square with side length k, 1 <= k <= n - floor(n/3), can be placed within a bi-symmetric triangle of 1 X 1 squares of height n. A241526

The smallest k >= 0 that can be represented as a linear combination of 1², 2², ..., n² with coefficients +-1 and that cannot be represented using 1², 2², ..., m² with 1<=m<n. A392127