Properties of the Number 13483

Thirteen Thousand Four Hundred Eighty-Three

Basics

Value: 13482 → 13483 → 13484

Parity: odd

Prime: No

Previous Prime: 13477

Next Prime: 13487

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 97 × 139

Divisors: 1, 97, 139, 13483

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010101011

Octal: 32253

Duodecimal: 7977

Hexadecimal: 34ab

Square: 181791289

Square Root: 116.11632098891181

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

Poincaré series for invariant polynomial functions on the space of binary forms of degree 9. A293934

Sum of the second largest parts in the partitions of n into 6 parts. A308872

c(i,j) is cost of evaluation of edit distance of two strings with lengths i and j, when you use recursion (every call has a unit cost, other computations are free); sequence gives c(n,n). A27618

Triangle of coefficients of polynomials v(n,x) jointly generated with A209170; see the Formula section. A209171

Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by all parts. A330952

a(0) = ... = a(3) = 1; a(n) = ∑_k=1..n-4 a(k) * a(n-k-4). A346048

Numbers k such that φ(k) > φ(k+1) > φ(k+2) > φ(k+3) where φ is the Euler totient function (A000010). A326817

Pseudoprimes to base 96. A20224

a(n) = n² + 731·n + 1. A180919

Satisfies ∑_n>=0 a(n)*xⁿ = x / ∏_n>=0 (1 - xⁿ/(1 - xⁿ))^a(n). A248870