Properties of the Number 7090

Seven Thousand Ninety

Basics

Value: 7089 → 7090 → 7091

Parity: even

Prime: No

Previous Prime: 7079

Next Prime: 7103

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 709

Divisors: 1, 2, 5, 10, 709, 1418, 3545, 7090

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101110110010

Octal: 15662

Duodecimal: 412A

Hexadecimal: 1bb2

Square: 50268100

Square Root: 84.20213774008353

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 with no difference -2. A350842

Numbers k such that 7^k - 2 is a prime. A90669

Number of one-element transitions among partitions of the integer n for unlabeled parts. A93695

Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = determinant. A280588

Number of permutations of length n that avoid the patterns 132, 4321. A116701

Expansion of (χ(x) / χ(-x⁶))² in powers of·where χ() is a Ramanujan θ function. A328790

a(n) = ∑_k=1..n floor(n/(2·k-1))^k. A350147

a(n)=7·a(n-1)-5·a(n-2), a(0)=1, a(1)=5. A147837

a(n) is the number of terminal states that can be achieved via the following algorithm: start with n piles each containing one stone; stones can be transferred between piles only when the piles start with the same number of stones. A292728

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)², where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296249