Properties of the Number 13159

Thirteen Thousand One Hundred Fifty-Nine

Basics

Value: 13158 → 13159 → 13160

Parity: odd

Prime: Yes

Previous Prime: 13151

Next Prime: 13163

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13159

Divisors: 1, 13159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001101100111

Octal: 31547

Duodecimal: 7747

Hexadecimal: 3367

Square: 173159281

Square Root: 114.71268456452408

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 partitions of n into squarefree parts. A73576

Primes p such that 6p + 7 is a square. A110014

a(n) = 1+5·n+7·n². A168235

Number of integer partitions of the n-th squarefree number using squarefree numbers. A303365

Primes congruent to 2 mod 59. A142729

Least prime p = 1 (mod n) which divides Fibonacci((p-1)/n). A168171

Primes p such that 2*(p²-1) - 1 and 2*(p²-1) + 1 are also primes. A247101

Primes p such that x⁴³ = 2 has no solution mod p. A59243

Primes of the form 55x²+10xy+199y². A140632

Prime chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural expression of a single polynomial. The equations are either subsequences of x² - 79x + 1601 or transforms with one exception: 100x² - 2260x + 12959. The other four distinct equations are Euler-derived: 25x² - 1185x + 14083, 25x² - 775x + 6047, 100x² - 2280x + 13159, 100x² - 4160x + 43427. A140708