Properties of the Number 18662

Eighteen Thousand Six Hundred Sixty-Two

Basics

Value: 18661 → 18662 → 18663

Parity: even

Prime: No

Previous Prime: 18661

Next Prime: 18671

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 31 × 43

Divisors: 1, 2, 7, 14, 31, 43, 62, 86, 217, 301

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100011100110

Octal: 44346

Duodecimal: A972

Hexadecimal: 48e6

Square: 348270244

Square Root: 136.6089308939939

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

Moore lower bound on the order of a (7,g)-cage. A198307

Numbers that are repdigits with length > 2 in more than one base. A167783

Number of ways to write n as an ordered sum of 7 primes. A340963

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A235310

Numbers m such that β(m) = τ(m)/2 + 1 where β(m) is the number of Brazilian representations of m and τ(m) is the number of divisors of m. A326381

Non-oblong composites m such that β(m) = τ(m)/2 + 1 where β(m) is the number of Brazilian representations of m and τ(m) is the number of divisors of m. A326388

Irregular table read by rows: Take a heptagon with all diagonals drawn, as in A329713. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. A329714

Numbers that are repdigits in base 6. A48331

Number of Boolean functions realized by cascades of n gates. A5610

a(n) = floor(binomial(n,9)/9). A11855