Properties of the Number -37975

Thirty-Seven Thousand Nine Hundred Seventy-Five

Basics

Value: -37976 → -37975 → -37974

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 7 ² × 31

Divisors: 1, 5, 7, 25, 31, 35, 49, 155, 175, 217

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001010001010111

Octal: -112127

Duodecimal: -19B87

Hexadecimal: -9457

Square: 1442100625

Square Root: 194.87175269905077

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

Signed recurrence over binary strict trees: a(n) = 1 - ∑_{x + y = n, 0 < x < y < n} a(x) * a(y). A300866

a(n) = a(n-1) + a(n-6), with a(i) = 1 for i = 0..5. A5708

a(n) = ∑_{k=0..floor(n/2)} binomial(3·n-5·k,k). A373638

Expansion of 1/(1 - x⁶ - x⁷ - x⁸ - ...). A17900

Smallest number m such that m and the product of digits of m are both divisible by 7n, or 0 if no such number exists. A73908

Smallest number m such that m and the product of digits of m are both divisible by 5n, or 0 if no such number exists. A73911

a(n) = A276086(n)*A276086(σ(n)-n) - A276086(σ(n)), where A276086 is the primorial base exp-function, and σ is the sum of divisors function. A388281

Number of compositions of 6·n-3 into parts 1 and 6. A373958

a(n) is the index of the n-th nonattacking queen placed by a greedy algorithm on a subset of N^N (see Comments for details). A309817

a(n) = ∑_k=0..n binomial(5·k,n-k). A360090