Properties of the Number 13981

Thirteen Thousand Nine Hundred Eighty-One

Basics

Value: 13980 → 13981 → 13982

Parity: odd

Prime: No

Previous Prime: 13967

Next Prime: 13997

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 31 × 41

Divisors: 1, 11, 31, 41, 341, 451, 1271, 13981

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011010011101

Octal: 33235

Duodecimal: 8111

Hexadecimal: 369d

Square: 195468361

Square Root: 118.24127874815969

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

a(n) is the (n+1)st (n+2)-gonal number. A64808

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Pseudoprimes to base 5. A5936

Pseudoprimes to base 10. A5939

Number of symmetric plane partitions of n. A5987

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Sarrus numbers A001567 that are not Carmichael numbers A002997. A153508

Composite integers k such that 2^k == 2 (mod k*(k+1)). A217465