Properties of the Number -372100

Three Hundred Seventy-Two Thousand One Hundred

Basics

Value: -372101 → -372100 → -372099

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 ² × 61 ²

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 61, 100

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -1011010110110000100

Octal: -1326604

Duodecimal: -15B404

Hexadecimal: -5ad84

Square: 138458410000

Square Root: 610

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) = ( a(n-1) * a(n-3) + a(n-2) ) / a(n-4), a(1) = a(2) = 1, a(3) = -1, a(4) = -4. A206282

Squared Fibonacci numbers: a(n) = F(n)² where F = A000045. A7598

a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2. A6498

Number of n X 1 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4. A195971

a(n) = (Lucas(4·n+2) + 2)/5, or Fibonacci(2·n+1)², or A081067(n)/5. A81068

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor. A221087

T(n,k)=Number of nXk 0..3 arrays with rows and antidiagonals unimodal. A223801

T(n,k)=Number of nXk 0..3 arrays with rows, diagonals and antidiagonals unimodal. A223876

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2. A264017

T(n,k)=Number of nXk 0..3 arrays with rows, antidiagonals and columns unimodal. A223762