Properties of the Number 13292

Thirteen Thousand Two Hundred Ninety-Two

Basics

Value: 13291 → 13292 → 13293

Parity: even

Prime: No

Previous Prime: 13291

Next Prime: 13297

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 3323

Divisors: 1, 2, 4, 3323, 6646, 13292

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001111101100

Octal: 31754

Duodecimal: 7838

Hexadecimal: 33ec

Square: 176677264

Square Root: 115.29093633065871

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

Sum of the smallest parts of the partitions of n into 9 parts. A326465

Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639). A242490

E.g.f.: A(x,y) = exp(y)*P(x) - Q(x,y), where P(x) = 1/∏_n>=1 (1 - xⁿ/n) and Q(x,y) = ∑_n>=1 yⁿ / ∏_k=1..n (k - x^k). A249480

Number of partitions of n in which any two parts differ by at most 9. A218511

Numbers with no 1's in base 3 & 4 expansions. A117496

Row sums of triangle A096811, in which A096811(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-2). A96814

Triangle read by rows: T(n,k) = (n-1)*T(n-1,k) + T(n-2,k), with T(n,n-1)=1, T(n,n-2)=n-2, for n >= 1, 0 <= k <= n-1. A228340

Number of connected labeled graphs with n nodes and an even number of edges. A54939

Expansion of ∏_k=1..24 theta₃(q^k), where theta₃() is the Jacobi θ function. A320248

Numbers k such that 7·R_k+2 - 6·10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k. A257027