Properties of the Number 13945

Thirteen Thousand Nine Hundred Forty-Five

Basics

Value: 13944 → 13945 → 13946

Parity: odd

Prime: No

Previous Prime: 13933

Next Prime: 13963

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 2789

Divisors: 1, 5, 2789, 13945

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11011001111001

Octal: 33171

Duodecimal: 80A1

Hexadecimal: 3679

Square: 194463025

Square Root: 118.0889495253472

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(n) = 8·n² - 4·n + 1. A80856

a(n) = (prime(n)² + 1)/2. A66885

Numbers k such that σ(2·k-1) is a prime p. A247820

Third row of Pascal-(1,5,1) array A081580. A81589

Array read by antidiagonals: T(n,m) is the number of (undirected) cycles in the rook graph K_n X K_m. A286418

Least k such that prime(n)² divides binomial(2k,k). A110494

Numerators of cumulative sums of rational sequence A038110(k)/A038111(k). A161527

a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2·n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k. A24845

a(n) = (2·n-1)² + (2·n)². A60820

Start with a(1) = 1, a(2) = 3, then a(n)*2^k = a(n+1) + a(n+2), with 2^k the smallest power of 2 (k>0) such that all terms a(n) are positive integers. A233526