Properties of the Number 18190

Eighteen Thousand One Hundred Ninety

Basics

Value: 18189 → 18190 → 18191

Parity: even

Prime: No

Previous Prime: 18181

Next Prime: 18191

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 17 × 107

Divisors: 1, 2, 5, 10, 17, 34, 85, 107, 170, 214

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011100001110

Octal: 43416

Duodecimal: A63A

Hexadecimal: 470e

Square: 330876100

Square Root: 134.8703080740902

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

Expansion of 1/(1 - ∑_k>=2 floor(1/ω(k))*x^k), where ω(k) is the number of distinct prime factors (A001221). A280195

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits. A262917

Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 8 sites wide. A58365

G.f.: (1 + x⁴ + x⁵ + x⁶ + x¹⁰ + x¹¹ + x¹² + x¹⁶)/∏_i=1..8 (1 - xⁱ). A256975

Number of compositions (ordered partitions) of n into parts with an odd number of distinct prime divisors. A286224

Values of y in solutions (x,y,z) to the Diophantine equation x³-x²+y³-y²=z³-z², with 1<x<y<z arranged in order of increasing x. A138668

Number of (n+1)X(5+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits. A262914

Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits. A262919

Number of nX6 0..1 arrays with every element equal to 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298185

a[n] =a[n-1] + 2·n*Prime[n]-n². A93809