Properties of the Number 13293

Thirteen Thousand Two Hundred Ninety-Three

Basics

Value: 13292 → 13293 → 13294

Parity: odd

Prime: No

Previous Prime: 13291

Next Prime: 13297

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 211

Divisors: 1, 3, 7, 9, 21, 63, 211, 633, 1477, 1899

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001111101101

Octal: 31755

Duodecimal: 7839

Hexadecimal: 33ed

Square: 176703849

Square Root: 115.29527310345381

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

a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations. A23109

Number of up/down (or down/up) patterns of length n. A350354

Number of noncrossing connected graphs on n nodes on a circle having no triangular faces. A45743

Partition numbers rounded to nearest integer given by the Hardy-Ramanujan approximate formula. A50811

Numbers n such that n⁶ + 272 is prime. A161998

a(n) = 13·2ⁿ⁺¹ - 19. A275163

Triangle of coefficients T(n,k) of y^k in ∏_k=0..n-1 (1 + (k+2)*y + y²), read by rows of terms k = 0..2·n, for n >= 0. A324960

G.f.: ∑_n>=0 xⁿ * ∏_k=0..n-1 ( 1 + (1+x)^n+k ). A338179

Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations. A15994

Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,.... A89435