Properties of the Number 18004

Eighteen Thousand Four

Basics

Value: 18003 → 18004 → 18005

Parity: even

Prime: No

Previous Prime: 17989

Next Prime: 18013

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 × 643

Divisors: 1, 2, 4, 7, 14, 28, 643, 1286, 2572, 4501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100011001010100

Octal: 43124

Duodecimal: A504

Hexadecimal: 4654

Square: 324144016

Square Root: 134.17898494175606

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 i in range [A165598(n),A165598(n+1)] for which abs(A165597(i)) gets the maximum value in that range. A165599

a(n) is the number of vertices formed by n-secting the angles of a heptagon. A335758

Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of xⁿ*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy·f(x,y)⁴ and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy·g(x,y)² = 0. A89447

Number of ternary words of length n and having exactly one run of 0's of odd length. A119915

Triangle where g.f. of row n = ∏_i=0..n [F(i+1) + F(i)*x] for n>=0, where F(i) = A000045(i) is the i-th Fibonacci number. A130405

Number of partitions p of n such that (number of numbers in p that have multiplicity 1) < (number of numbers in p having multiplicity > 1). A330001

Diagonal of square table A089447, which lists the coefficients of xⁿ*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy·f(x,y)⁴ and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy·g(x,y)² = 0. A89448

Triangle read by rows: T(n,k) is number of ternary words of length n and having k runs of 0's of odd length (0 <= k <= ceiling(n/2); a run of 0's is a subsequence of consecutive 0's of maximal length). A119914

Number n such that the sum of its proper evil divisors (A001969) equals n. A230587

Number of integers in n-th generation of tree T(2^-1/3) defined in Comments. A274158