Properties of the Number -4290

Two Hundred Ninety

Basics

Value: -4291 → -4290 → -4289

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 11 × 13

Divisors: 1, 2, 3, 5, 6, 10, 11, 13, 15, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000011000010

Octal: -10302

Duodecimal: -2596

Hexadecimal: -10c2

Square: 18404100

Square Root: 65.49809157525127

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 ∏_k>=1 (1 - x^k)¹¹. A10819

a(n) = ∑_t=0..n g(t)*g(n-t) where g(t) = A002121(t). A2122

Table read by rows. T(n, k) = (-1)^{n - k} * ∑_j=k..n binomial(n, j) * A354794(j, k) * j^{n - j}. A359759

A triangle sequence of matrix polynomials: M(d)=Table[If[ m == n, n!, 1], {n, 1, d}, {m, 1, d}].Table[If[ m == n, d!/n!, -1], {n, 1, d}, {m, 1, d}]. A158419

The squarefree numbers ordered lexicographically by their prime factorization (with factors written in decreasing order). a(n) = ∏_{k in I} prime(k+1), where I is the set of indices of nonzero binary digits in n = ∑_{k in I} 2^k. A19565

a(n) = 2·n*(2·n-1). A2939

Products of exactly 5 distinct primes. A46387

Smallest j with n nodes in its riff (rooted index-functional forest). A62860

Triangular array read by rows: T(n,k) = Fibonacci(n+1-k)*C(n,k-1), k = 1..n; n >= 1. A94440

Numbers that are the sum of 6 positive 6th powers. A3362