Properties of the Number 14645

Fourteen Thousand Six Hundred Forty-Five

Basics

Value: 14644 → 14645 → 14646

Parity: odd

Prime: No

Previous Prime: 14639

Next Prime: 14653

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 29 × 101

Divisors: 1, 5, 29, 101, 145, 505, 2929, 14645

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11100100110101

Octal: 34465

Duodecimal: 8585

Hexadecimal: 3935

Square: 214476025

Square Root: 121.01652779682617

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) is the smallest number k larger than a(n-1) such that n·d(k)*sopf(k)=σ(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472). A134382

T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s. A295551

Coefficients in the expansion of C⁴/B⁵, in Watson's notation of page 118. A160528

a(n) = 11ⁿ + n. A226737

Number of integer partitions of n whose multiplicities have multiplicities that cover an initial interval of positive integers. A325330

a(n) = n⁴+4 = (n²-2·n+2)*(n²+2·n+2) = ((n-1)²+1)*((n+1)²+1). A57781

a(n) = smallest k having at least three prime divisors d such that (d + n) | (k + n). A202158

Rectangular array: (row n) = b**c, where b(h) = h³, c(h) = (n-1+h)³, n>=1, h>=1, and ** = convolution. A213558

Expansion of ∏_m>=1 (1 + m·q^m)⁵. A22633

Repunit pseudoprimes: composite numbers k such that (10^k - 1)/9 == 1 (mod k). A303608