Properties of the Number 18998

Eighteen Thousand Nine Hundred Ninety-Eight

Basics

Value: 18997 → 18998 → 18999

Parity: even

Prime: No

Previous Prime: 18979

Next Prime: 19001

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 23 × 59

Divisors: 1, 2, 7, 14, 23, 46, 59, 118, 161, 322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100101000110110

Octal: 45066

Duodecimal: ABB2

Hexadecimal: 4a36

Square: 360924004

Square Root: 137.83323256747627

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

Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows. A293815

Number of terms in 5th derivative of a function composed with itself n times. A22815

Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape N; triangle T(n,k), n>=0, read by rows. A247705

Number of compositions of n such that two adjacent parts are not equal modulo 4. A62202

Number of tilings of a 5 X n rectangle using n pentominoes of any but the N shape. A247769

Number of sets of exactly three nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293965

First term of n-th difference sequence of (floor(k·r)), r = -sqrt(2), k >= 0. A325665

a(n) = 36·n² - 2·n. A158062

Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles. A193068

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