Properties of the Number 8091

Eight Thousand Ninety-One

Basics

Value: 8090 → 8091 → 8092

Parity: odd

Prime: No

Previous Prime: 8089

Next Prime: 8093

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 29 × 31

Divisors: 1, 3, 9, 29, 31, 87, 93, 261, 279, 899

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1111110011011

Octal: 17633

Duodecimal: 4823

Hexadecimal: 1f9b

Square: 65464281

Square Root: 89.9499861033897

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) = ceiling(a(n-1)*3/2) with a(1) = 1. A61419

Number of numbers whose base-3/2 expansion (see A024629) has n digits. A81848

G.f. satisfies: A(x) = 1 + x/A(-x·A(x)⁴). A213093

Number of integer partitions of n whose distinct parts are pairwise coprime. A304709

a(n) = n*(n+2)*(n-2)/3. A77415

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_{1 <= x₁, x₂, ..., x_k <= n} gcd(x₁, x₂, ..., x_k). A344479

Euler transform of n·A065958(n). A156733

Numbers k such that k² == 2 (mod 23²). A156849

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4. A240327

a(n) = ∑_{1 <= i, j, k, l, m <= n} gcd(i,j,k,l,m). A344524