Properties of the Number -18067

Eighteen Thousand Sixty-Seven

Basics

Value: -18068 → -18067 → -18066

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 29 × 89

Divisors: 1, 7, 29, 89, 203, 623, 2581, 18067

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100011010010011

Octal: -43223

Duodecimal: -A557

Hexadecimal: -4693

Square: 326416489

Square Root: 134.41354098453027

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

E.g.f. A(x) satisfies A(x) = 1/( 1 - x·cos(x·A(x)^1/2) ). A381302

Expansion of ∏_k>=0 (1-x^5·k+1)^5·k+1. A285071

Expansion of ∏_k>=1 (1 + x^5·k-4)^5·k-4. A285338

Number of parts in all partitions of n in which no part occurs more than five times. A320608

Fibonacci sequence beginning 1, 29. A22399

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones. A31789

Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc. A123326

Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing. A224141

Sequence of distinct least positive numbers such that the average of the first n terms is a Fibonacci number. A248982

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 249", based on the 5-celled von Neumann neighborhood. A271014