Properties of the Number 18912

Eighteen Thousand Nine Hundred Twelve

Basics

Value: 18911 → 18912 → 18913

Parity: even

Prime: No

Previous Prime: 18911

Next Prime: 18913

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 197

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100111100000

Octal: 44740

Duodecimal: AB40

Hexadecimal: 49e0

Square: 357663744

Square Root: 137.52090750136867

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 partitions of n such that the number of parts having multiplicity >1 is not a part and the number of distinct parts is a part. A241410

Triangle read by rows: T(n,k) is the number of rooted ordered trees with node weights summing to n, where the root has weight 0, all internal nodes have weight 1, and leaf nodes have weights in {1,...,k}. A384685

a(n) = ∑_i=0..n ∑_j=0..n (i XOR j), where XOR is the binary logical exclusive-or operator. A224923

a(n) = prime(n)*(prime(n-1)-1)/2. A14302

Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k). A63968

Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -2<=w+x+y<=2. A211616

Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y| distinct. A213490

a(n) = 3*(3·n+1)*(9·n+8)/2. A304504

Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one longer than the preceding run of 1's, and the expansion ends with a 0-run. A387269

Starting positions of strings of three 4's in the decimal expansion of π. A83615