Properties of the Number 1964

One Thousand Nine Hundred Sixty-Four

Basics

Value: 1963 → 1964 → 1965

Parity: even

Prime: No

Previous Prime: 1951

Next Prime: 1973

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 491

Divisors: 1, 2, 4, 491, 982, 1964

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11110101100

Octal: 3654

Duodecimal: 1178

Hexadecimal: 7ac

Square: 3857296

Square Root: 44.31703961232068

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 integer partitions of n with no adjacent parts having quotient > 2. A342094

Numbers k such that k²+1 and (k+2)²+1 are both prime; twin k²+1 primes. A96012

Positive integers n such that n¹⁰ + 1 is semiprime. A105078

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays x(i,j) with row sums sum{j·x(i,j), j=1..k+1} nondecreasing, and column sums sum{i²*x(i,j), i=1..n+1} nondecreasing. A233366

Four times the sum of all divisors of all positive integers <= n. A243980

Expansion of ∏_k=1..8 theta₃(q^k), where theta₃() is the Jacobi θ function. A320234

Expansion of φ(q) / φ(q³) in powers of q where φ() is a Ramanujan θ function. A139137

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the upper median value of each 2X2 subblock. A235972

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001. A259642

Number of compositions (ordered partitions) of n into distinct parts, the least being 3. A339164