Properties of the Number 2867

Two Thousand Eight Hundred Sixty-Seven

Basics

Value: 2866 → 2867 → 2868

Parity: odd

Prime: No

Previous Prime: 2861

Next Prime: 2879

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 47 × 61

Divisors: 1, 47, 61, 2867

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101100110011

Octal: 5463

Duodecimal: 17AB

Hexadecimal: b33

Square: 8219689

Square Root: 53.54437412091022

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

Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = T(n-1,1), T(n,k) = T(n-1,k-1) + 3·T(n-1,k) + T(n-1,k+1) for k >= 1. A126970

a(n) = n*(n + 14). A98848

Number of integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode. A363719

Numerator of 1/49 - 1/n². A61047

Number of strict integer partitions of n with no difference -2. A350844

a(1) = 1; for n > 1, a(n) is the smallest positive number such that a(n) - a(n-1) = sopfr(a(n)) + sopfr(a(n-1)), where sopfr(k) is the sum of the primes dividing k, with repetition. A369348

G.f. satisfies: A(x) = ∑_n>=0 n!*xⁿ*A(x)ⁿ. A88368

Number of 3-Motzkin paths of length n with no level steps at height 0. A117641

Number T(n,k) of symmetrically unique Dyck paths of semilength n and height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A291883

Numbers n such that the second maximal prime <= sqrt(n) is the least prime divisor of n. A247393