Properties of the Number -371

Three Hundred Seventy-One

Basics

Value: -372 → -371 → -370

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 7 × 53

Divisors: 1, 7, 53, 371

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -101110011

Octal: -563

Duodecimal: -26B

Hexadecimal: -173

Square: 137641

Square Root: 19.261360284258224

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

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 4. A60023

Expansion of ∏_n>=1 (1 - xⁿ)⁷. A730

Coefficients of the '2nd-order' mock θ function μ(q). A6306

Triangle T, read by rows, such that column k equals column 0 of T^k+1, where column 0 of T allows the n-th row sums to be zero for n>0 and where T^k is the k-th power of T as a lower triangular matrix. A101897

The sequence is {a(n), n>=0}, the concatenation of the binary expansions of the absolute values |a(n)| is {b(n), n>=0}; start with a(0)=0; thereafter a(n) = a(n-1)+n if b(n-1)=0, otherwise a(n) = a(n-1)-n. A309217

G.f. A(x) satisfies [x^2·n] A(x)^5·n = 5 and [x^2·n+1] A(x)^5·n+2 = [x^2·n+1] A(x)^5·n+3 for n >= 1. A377097

Extrapolation for (n + 1)-st odd prime made by fitting least-degree polynomial to first n odd primes. A140118

G.f.: x^(k²+k/2)/(mul(1-xⁱ,i=1..k)*mul(1+x^r,r=1..oo)) with k = 4. A246583

a(n+1) = a(n) - a(floor(n/2)), with a(0)=0, a(1)=1. A62187

Expansion of ∏_k>=1 (1 + x^3·k)^3·k / (1 + x^k)^k. A285294