ℕ atory
Play Now

Properties of the Number 13844

Thirteen Thousand Eight Hundred Forty-Four

Basics

Value: 13843 → 13844 → 13845

Parity: even

Prime: No

Previous Prime: 13841

Next Prime: 13859

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 2 × 3461

Divisors: 1, 2, 4, 3461, 6922, 13844

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011000010100

Octal: 33024

Duodecimal: 8018

Hexadecimal: 3614

Square: 191656336

Square Root: 117.66052864066182

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

Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639). A242719
Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639). A242489
Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists. A344072
Number of 6-regular bipartitions of n. A328548
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n having exactly k down steps hitting the x-axis. A101275
G.f. satisfies A(x) = ( 1 + x * (1 + x·A(x)2) )2. A371607
Number of basis partitions of n+25 with Durfee square size 5. A53800
a(1)=1 and a(2)=1; if a(n-1) + a(n-2) == 0 (mod n) then a(n) = (a(n-1) + a(n-2))/n else a(n) = a(n-1) + a(n-2). A330139
Numbers k such that σ(σ(k) - k) = φ(σ(k) + k). A74886
Number of triangular matrices T(n,i,k), k <= i <= n, with entries "0" or "1" with the property that each triple {T(n,i,k), T(n,i,k+1), T(n,i-1,k)} containing a single "0" can be successively replaced by {1, 1, 1} until finally no "0" entry remains. A295928