Properties of the Number 66330

Sixty-Six Thousand Three Hundred Thirty

Basics

Value: 66329 → 66330 → 66331

Parity: even

Prime: No

Previous Prime: 66301

Next Prime: 66337

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 11 × 67

Divisors: 1, 2, 3, 5, 6, 9, 10, 11, 15, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000001100011010

Octal: 201432

Duodecimal: 32476

Hexadecimal: 1031a

Square: 4399668900

Square Root: 257.54611237601705

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 primes between n·10⁶ and (n+1)*10⁶. A38826

Run lengths of the most significant decimal digit in the primes (A077648). A376129

θ series of 10-d 11-modular Craig lattice A₁₀³. A28995

Dedekind numbers or Dedekind's problem: number of monotone Boolean functions of n variables, number of antichains of subsets of an n-set, number of elements in a free distributive lattice on n generators, number of Sperner families. A372

G.f. A(x) satisfies: A(x) = 1 + x*∑_n>=0 log( A(3ⁿ*x) )ⁿ / n!. A156904

Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists. A66330

a(n) = A342068(10ⁿ). A342852

Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 2D square grid confined to an infinite strip of height 2h where the walk starts at coordinate (0,h). A336988