Properties of the Number 2911

Two Thousand Nine Hundred Eleven

Basics

Value: 2910 → 2911 → 2912

Parity: odd

Prime: No

Previous Prime: 2909

Next Prime: 2917

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 41 × 71

Divisors: 1, 41, 71, 2911

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 101101011111

Octal: 5537

Duodecimal: 1827

Hexadecimal: b5f

Square: 8473921

Square Root: 53.95368384086484

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) = 4·a(n-1) - a(n-2) with a(0) = 0, a(1) = 1. A1353

Number of reduced words of length n in the Weyl group E₆ on 6 generators and order 51840. A161409

a(n) = 4·a(n-2) - a(n-4) for n > 1, a(n) = n for n = 0, 1. A2530

T(n,m) = number of 1..m integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171275

a(n) = a(n-1) + a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1. A298338

Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid. A116469

Numbers n such that 97 is the largest prime factor of n² - 1. A181470

Number of partitions of n which represent first player winning Chomp positions with multiple winning moves. A112473

Bisection of A001353. Indices of square numbers which are also octagonal. A28230

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 4·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367209