Properties of the Number 18896

Eighteen Thousand Eight Hundred Ninety-Six

Basics

Value: 18895 → 18896 → 18897

Parity: even

Prime: No

Previous Prime: 18869

Next Prime: 18899

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 1181

Divisors: 1, 2, 4, 8, 16, 1181, 2362, 4724, 9448, 18896

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100100111010000

Octal: 44720

Duodecimal: AB28

Hexadecimal: 49d0

Square: 357058816

Square Root: 137.46272221951665

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 of tilings of a 5 X n rectangle using n pentominoes of shapes Y, U, X. A247268

Number of arrangements of 4 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero. A189547

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

Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime. A270446

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

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

A problem in derangements. A13520

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 1, -1), (1, 1, 1)}. A151003

a(n) = ( a(n-1)*a(n-7) + a(n-4)² ) / a(n-8); a(0) = ... = a(7) = 1. A18896

Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the number of inversions of the word formed by the leading entries of the blocks of p is k. A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. For example, the permutation 5412367 has 4 blocks: 5, 4, 123, and 67; their leading entries are 5,4,1, and 6 and the word 5416 has 3 inversions. A186372