Properties of the Number 4467

Four Thousand Four Hundred Sixty-Seven

Basics

Value: 4466 → 4467 → 4468

Parity: odd

Prime: No

Previous Prime: 4463

Next Prime: 4481

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 1489

Divisors: 1, 3, 1489, 4467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000101110011

Octal: 10563

Duodecimal: 2703

Hexadecimal: 1173

Square: 19954089

Square Root: 66.83561924602779

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

Number of terms in n-th derivative of a function composed with itself 3 times. A22811

Number of partitions of n having depth 1; see Comments. A237685

Expansion of ∏_k>=1 (1 - x^8·k)/(1 - x^k). A261775

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

a(n) = (11·n² - 11·n + 2)/2. A69125

a(n) = (n³ - 7·n + 12)/6. A105163

a(n) = n + (n-1)² + (n+1)². A96376

Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i are sorted and have i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A327244

Indices k such that 3 plus the k-th triangular number is a perfect square. A154138

a(n) = ∑_{i+j+k=n, i,j,k >= 1} τ(i)*τ(j)*τ(k), where τ() = A000005(). A191829