Properties of the Number 13430

Thirteen Thousand Four Hundred Thirty

Basics

Value: 13429 → 13430 → 13431

Parity: even

Prime: No

Previous Prime: 13421

Next Prime: 13441

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 17 × 79

Divisors: 1, 2, 5, 10, 17, 34, 79, 85, 158, 170

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010001110110

Octal: 32166

Duodecimal: 7932

Hexadecimal: 3476

Square: 180364900

Square Root: 115.88787684654508

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 integer partitions of n with integer alternating product. A347446

Sum over all partitions of n of the number of distinct parts i of multiplicity i - 1. A277101

Triangle of coefficients T(n,k) in g.f. A(x,y) satisfying ∑_n=-oo..+oo (-1)ⁿ * (xⁿ + y·A(x,y))ⁿ = 1 + (y+2)*∑_n>=1 (-1)ⁿ * x^n², for n >= 1, as read by rows. A370040

Triangle read by rows: Take a pentagram with all diagonals drawn, as in A331906. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+2. A331907

Numbers whose set of base 11 digits is {0,A}, where A base 11 = 10 base 10. A97257

a(n) = 5·a(n-1) - a(n-2), a(0) = 3, a(1) = 25. A99868

Number of peakless Motzkin paths of length n having no (1,0)-steps at levels 0,2,4,... . A190165

Expansion of ∑_i>=1 x^i*(i+1/2)/(1 - x^i*(i+1/2)) / ∏_j>=1 (1 - x^j*(j+1/2)). A281615

Number of parts in all partitions of n with largest multiplicity four. A320374

G.f.: ∏_{k >= 0} ((1 + x^2·k+1) / (1 - x^2·k+1))^k. A361008