Properties of the Number 1966

One Thousand Nine Hundred Sixty-Six

Basics

Value: 1965 → 1966 → 1967

Parity: even

Prime: No

Previous Prime: 1951

Next Prime: 1973

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 983

Divisors: 1, 2, 983, 1966

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11110101110

Octal: 3656

Duodecimal: 117A

Hexadecimal: 7ae

Square: 3865156

Square Root: 44.339598554790726

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

a(n) = ∑_d∣n p(d), where p(d) = A000041 = number of partitions of d. A47968

Number of ON states after n generations of cellular automaton based on triangles. A161644

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252384

Image of primes (A000040) under "little Hankel" transform that sends [c₀, c₁, ...] to [d₀, d₁, ...] where d_n = c_n² - c_n+1*c_n-1. A56221

Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows. A293815

a(n) = ∑_k=1..n φ(k)². A57434

The prime/nonprime compound sequence BAA. A270794

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of partitions of (n,k) into a sum of distinct pairs. A201377

Number of bipartite partitions of (n,n) into distinct pairs. A219554

a(n) = S2(n,1), where S2(n, t) = ∑_k=0..n k^t *(∑_j=0..k binomial(n,j))². A89664