Properties of the Number -37275

Thirty-Seven Thousand Two Hundred Seventy-Five

Basics

Value: -37276 → -37275 → -37274

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 7 × 71

Divisors: 1, 3, 5, 7, 15, 21, 25, 35, 71, 75

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001000110011011

Octal: -110633

Duodecimal: -196A3

Hexadecimal: -919b

Square: 1389425625

Square Root: 193.06734576307824

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 having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts. A364913

a(n) = (1/n) * ∑_i=0..n-1 C(n,i)*C(n,i+1)*2ⁱ*3^n-i, a(0)=1. A103210

Expansion of x/(1-3·x-8·x²). A15525

Square array T(n,d) read by antidiagonals: number of structurally-different guillotine partitions of a d-dimensional box in R^d by n hyperplanes. A103209

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n 2^j * binomial(n,j) * binomial(k·n+j+1,n)/(k·n+j+1). A336574

a(n) = -a(n-1) + a(n-2) - F(-n) + 1, a(0) = 1, a(1) = -1, where F() = Fibonacci numbers A000045. A175722

Numbers k such that the digits of k^1/8 begin with k. A331495

Triangle related to guillotine partitions of a k-dimensional box by n hyperplanes. A107702

Number of length 5 1..(n+2) arrays with no leading or trailing partial sum equal to a prime. A254208

Expansion of 1/((1-x)(1-4x)(1-7x)(1-9x)). A21864