Properties of the Number 13189

Thirteen Thousand One Hundred Eighty-Nine

Basics

Value: 13188 → 13189 → 13190

Parity: odd

Prime: No

Previous Prime: 13187

Next Prime: 13217

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 ² × 109

Divisors: 1, 11, 109, 121, 1199, 13189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001110000101

Octal: 31605

Duodecimal: 7771

Hexadecimal: 3385

Square: 173949721

Square Root: 114.84337159801605

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 into an odd number of parts, the greatest of which is odd. A340385

Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i·j*k| <= n. A226359

S₅ sequence in partition of integers > 1 described in A240521. A240522

Numbers k for which the 3-adic valuations of k and σ(k) are equal, and that also satisfy Euler's criterion for odd perfect numbers (see A228058). A349755

Numbers k such that σ(k+1) = 2*φ(k). A67260

Numbers k satisfying Euler's criterion for odd perfect numbers (A228058), such that σ(k)+k is also a multiple of 3, and σ(k) preserves the 3-adic valuation of k, where σ is the sum of divisors function. A387162

a(n) = n⁴ - n³ - n². A132998

Total sum of parts of multiplicity 10 in all partitions of n. A222738

Numbers such that the sequence of all possible sums of divisors of n is increasing but not strictly so, the sums being ordered by their characteristic functions, seen as binary numbers (see example). A230492

Number of partitions of n with eight parts in which no part occurs more than twice. A320596