4467
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5960
- Proper Divisor Sum (Aliquot Sum)
- 1493
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2976
- Möbius Function
- 1
- Radical
- 4467
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 139
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = ceiling(24(2^n-1)/n).at n=10A003177
- Coordination sequence T2 for Zeolite Code MTT.at n=41A008190
- Coordination sequence for sigma-CrFe, Position Xd.at n=17A009959
- Number of terms in n-th derivative of a function composed with itself 3 times.at n=16A022811
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=21A031563
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=11A049975
- a(n) = A048141(3*n).at n=43A051061
- a(n) = (11*n^2 - 11*n + 2)/2.at n=28A069125
- a(n) = n + (n-1)^2 + (n+1)^2.at n=47A096376
- a(n) = (n^3 - 7*n + 12)/6.at n=29A105163
- a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's.at n=26A108564
- Number of permutations of length n which avoid the patterns 231, 1234, 4312; or avoid the patterns 312, 1234, 1432, etc.at n=48A116735
- Where record values occur in A062039.at n=49A123644
- Numbers k that divide 3^((k-1)/2) - 2^((k-1)/2) - 1.at n=33A130061
- Where records occur in A134204.at n=44A133245
- Records in A153004.at n=36A153838
- Indices k such that 3 plus the k-th triangular number is a perfect square.at n=9A154138
- 3 times centered triangular numbers: 9*n*(n+1)/2 + 3.at n=31A164013
- a(n) = Sum_{i+j+k=n, i,j,k >= 1} tau(i)*tau(j)*tau(k), where tau() = A000005().at n=21A191829
- a(n) = 9*n^2 - 13*n + 5.at n=22A214675