Properties of the Number 2849

Two Thousand Eight Hundred Forty-Nine

Basics

Value: 2848 → 2849 → 2850

Parity: odd

Prime: No

Previous Prime: 2843

Next Prime: 2851

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 11 × 37

Divisors: 1, 7, 11, 37, 77, 259, 407, 2849

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101100100001

Octal: 5441

Duodecimal: 1795

Hexadecimal: b21

Square: 8116801

Square Root: 53.376024580330075

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) = n*(2·n + 3). A14106

Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing). A19298

Let a(n) be the least k such that in the prime power factorization of k! the exponents of primes p₁, ...,p_n are even, while the exponent of p_n+1 is odd. A240537

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·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². A367208

Number of ordered pairs (i,j) with |i| + |j| <= n and gcd(i,j) <= 1. A100449

Numbers whose square is the sum of the squares of 11 consecutive integers. A218395

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nXk array. A218592

Divisors of 999999. A27892

Number of properly colored labeled graphs on n nodes so that the color function is surjective onto {c₁,c₂,...,c_k} for some k, 1<=k<=n. A334282

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231