Properties of the Number 13809

Thirteen Thousand Eight Hundred Nine

Basics

Value: 13808 → 13809 → 13810

Parity: odd

Prime: No

Previous Prime: 13807

Next Prime: 13829

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 4603

Divisors: 1, 3, 4603, 13809

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010111110001

Octal: 32761

Duodecimal: 7BA9

Hexadecimal: 35f1

Square: 190688481

Square Root: 117.51170154499508

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) = least k such that the remainder when 24^k is divided by k is n. A128364

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A299128

y-value of the smallest solution to x² - p·y² = 2*(-1)^(p+1/4), p = A002145(n). A306566

Fundamental positive solution y(n) of the Diophantine equation x² - A045339(n)*y² = -2, for n >= 1. A339882

Denominators of continued fraction convergents to sqrt(491). A41937

Indices of primes in sequence defined by A(0) = 77, A(n) = 10·A(n-1) - 23 for n > 0. A56258

Numbers k such that 4^k - 5 is prime. A217348

Difference between π(10ⁿ) and nearest integer to (F[2n+1](S(n)))² where π(10ⁿ) = number of primes <= 10ⁿ (A006880), F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = ∑_i=0..2 (C(i)*(log(log(A*(B+n²))))²ⁱ) (see A227693). A227694

First differences of A000543. A100789

Number of n X 2 binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors. A183364