Properties of the Number 2837

Two Thousand Eight Hundred Thirty-Seven

Basics

Value: 2836 → 2837 → 2838

Parity: odd

Prime: Yes

Previous Prime: 2833

Next Prime: 2843

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2837

Divisors: 1, 2837

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101100010101

Octal: 5425

Duodecimal: 1785

Hexadecimal: b15

Square: 8048569

Square Root: 53.2634959423431

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

Coordination sequence for "flu" 3D uniform tiling formed from tetrahedra, rhombicuboctahedra, and cubes. A299272

Primes p such that continued fraction of (1 + sqrt(p))/2 has period 15: primes in A146338. A146360

Members of A164368 which are not Ramanujan primes. A164288

Levine's sequence. First construct a triangle as follows. Row 1 is {1,1}; if row n is {r₁, ..., r_k} then row n+1 consists of {r_k 1's, r_k-1 2's, r_k-2 3's, etc.}; sequence consists of the final elements in each row. A11784

a(0) = 1; for n>0, a(n) = smallest prime of the form k·a(n-1) + 1. A61092

Number T(n,k) of set partitions of [n] such that the maximal absolute difference between the least elements of consecutive blocks equals k; triangle T(n,k), n>=0, 0<=k<=max(n-1,0), read by rows. A287215

Primes p == 1 (mod 4) such that (p-1)/4 is prime. A90866

a(n) is the largest prime < 3·a(n-1) for n > 1, with a(1) = 2. A126031

Partial sums of A097988 (d₃(n)²). A330570

Primes such that the sum of the predecessor and successor primes is divisible by 11. A112789