Properties of the Number -39664

Thirty-Nine Thousand Six Hundred Sixty-Four

Basics

Value: -39665 → -39664 → -39663

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 37 × 67

Divisors: 1, 2, 4, 8, 16, 37, 67, 74, 134, 148

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1001101011110000

Octal: -115360

Duodecimal: -1AB54

Hexadecimal: -9af0

Square: 1573232896

Square Root: 199.15822855207364

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) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n. A56744

Indices of prime generalized tetranacci numbers, A073817. A104577

Where records occur in A261461. A261467

a(0) = 1; a(n) = ∑_{k=0..floor((n-1)/2)} (-3)^k * a(k) * a(n-2·k-1). A352010

Expansion of (theta₃(z)*theta₃(11z) + theta₂(z)*theta₂(11z))⁴. A28612

Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n. A91461

a(n) = smallest positive multiple of n that, when represented in binary, contains the binary representations of all positive integers <= n at least once each. A144144

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence). A24594

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A001950 (upper Wythoff sequence). A25108