Properties of the Number 18634

Eighteen Thousand Six Hundred Thirty-Four

Basics

Value: 18633 → 18634 → 18635

Parity: even

Prime: No

Previous Prime: 18617

Next Prime: 18637

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 × 11 ³

Divisors: 1, 2, 7, 11, 14, 22, 77, 121, 154, 242

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100011001010

Octal: 44312

Duodecimal: A94A

Hexadecimal: 48ca

Square: 347225956

Square Root: 136.50641010589942

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

Heinz numbers of integer partitions such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 1. A325179

Indices m such that A128646(m)-1 is prime, where A128646 = denominator of partial sums of 1/(p(i)-1). A137689

Number of ordered 10-tuples of distinct pairwise coprime positive integers with largest element n. A186981

Expansion of ∑_i>=1 μ(i)²*xⁱ/(1 - xⁱ) / ∏_j>=1 (1 - μ(j)²*x^j), where μ() is the Moebius function (A008683). A281572

Number of nonisomorphic minimal triangle graphs. A80

a(n) = floor(n³ / e). A32636

Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of two indistinguishable pieces P on an n X n board. A222308

a(n) is the least number such that the concatenation of all the previous terms with it is squarefree and has n prime factors. a(0)=0. A309234

a(n) = ∑_{k = 0..n} (-1)^n+k*binomial(n, k)*binomial(n+k, k)*A108625(n-1, n-k). A376458

a(n) = [xⁿ] ∏_k=1..n (1 + x^k)^n-k+1. A206229