Properties of the Number 2907

Two Thousand Nine Hundred Seven

Basics

Value: 2906 → 2907 → 2908

Parity: odd

Prime: No

Previous Prime: 2903

Next Prime: 2909

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 19

Divisors: 1, 3, 9, 17, 19, 51, 57, 153, 171, 323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101101011011

Octal: 5533

Duodecimal: 1823

Hexadecimal: b5b

Square: 8450649

Square Root: 53.91660226683428

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(1) = 1 and a(n) = ceiling((∑_k=1..n-1 a(k))/3) for n >= 2. A72493

Triangle formed from odd-numbered columns of triangle of expansions of powers of·in terms of Chebyshev polynomials U_n(x). Sometimes called Catalan's triangle. A39598

a(n) = n*(n+1)*(n+2)/2. A27480

Construct triangle in which n-th row is obtained by expanding (1 + x + x²)ⁿ and take the next-to-central column. A5717

Number of integer partitions of n with no adjacent parts having quotient > 2. A342094

Left half of trinomial triangle (A027907), triangle read by rows. A111808

Numbers n such that (prime(n)# + 4)/2 is a prime, where x# is the primorial A034386(x). A67027

a(n) = n*(5·n+1)/2. A5475

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows. A157208

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 9 as largest digit. A256709