Properties of the Number 18916

Eighteen Thousand Nine Hundred Sixteen

Basics

Value: 18915 → 18916 → 18917

Parity: even

Prime: No

Previous Prime: 18913

Next Prime: 18917

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 4729

Divisors: 1, 2, 4, 4729, 9458, 18916

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100111100100

Octal: 44744

Duodecimal: AB44

Hexadecimal: 49e4

Square: 357815056

Square Root: 137.53544997563355

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

Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1. A98485

Third row of Pascal-(1,4,1) array A081579. A81587

The number of ways of partitioning the multiset {1,1,2,3,...,n-1} into exactly three nonempty parts. A168583

Number of partitions p of n such that ceiling(mean(p)) is a part and floor(mean(p)) is not. A241341

Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n. A241500

a(n) = 3·3ⁿ - 3·2ⁿ + 1. A126644

Compound filter: a(n) = P(A286357(n), A161942(n)), where P(n,k) is sequence A000027 used as a pairing function. A286358

Array read by antidiagonals: T(n,k) = number of n X k lonesum decomposable (0,1) matrices. A299906

Numerators of continued fraction convergents to sqrt(569). A42090

Triangle read by rows: T(n,k) is the number of embeddings on the sphere of planar graphs with n vertices and k faces having connectivity exactly 2 and minimum vertex degree at least 3, k=6..2n-5. A378077