Properties of the Number 14961

Fourteen Thousand Nine Hundred Sixty-One

Basics

Value: 14960 → 14961 → 14962

Parity: odd

Prime: No

Previous Prime: 14957

Next Prime: 14969

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 4987

Divisors: 1, 3, 4987, 14961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001110001

Octal: 35161

Duodecimal: 87A9

Hexadecimal: 3a71

Square: 223831521

Square Root: 122.31516668017912

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

Expansion of ∏_k>=1 ((1 + k·x^k) / (1 + x^k)). A268500

(A178476(n)-3)/9. A178486

a(n) = ∑_k=0..n C(n,k)*C(n+k,k)*(2·k+1)², where C(m,k) denotes the binomial coefficient m!/(k!*(m-k)!). A180364

Number of partitions of n with difference -2 between the number of odd parts and the number of even parts, both counted without multiplicity. A242690

Triangle read by rows: T(n,k) = number of partitions of an n X k rectangle into one or more integer-sided rectangles, 1 <= k <= n = 1, 2, 3, ... A360451

G.f. A(x) satisfies: A(x) = x + x² * exp( ∑_k>=1 (-1)^k+1 * A(x^k)⁴ / (k·x^3·k) ). A363468

Numbers k such that k²+1 = 2p,(k+1)²+1 = 5q, (k+2)²+1 = 10r where p, q, and r are primes. A181619

a(n) = 8n² - 12n + 1. A273220

Number of integer partitions of n whose product is a powerful number. A330106

Expansion of (1-3·x+6·x²-5·x³+3·x⁴-x⁵)/(1-x)⁶. A89830