4406
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6612
- Proper Divisor Sum (Aliquot Sum)
- 2206
- 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
- 2202
- Möbius Function
- 1
- Radical
- 4406
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 51
- 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
- yes
- Odd
- no
Appears in sequences
- Weighted count of partitions with distinct parts.at n=29A005895
- If a, b in sequence, so is ab+10.at n=24A009368
- Coordination sequence T1 for Zeolite Code -CHI.at n=42A009846
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,5).at n=23A018917
- a(n+1) = a(n) converted to base 5 from base 4 (written in base 10).at n=17A023373
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=23A024980
- Expansion of g.f. 1/((1-2*x)*(1-3*x)*(1-5*x)*(1-12*x)).at n=3A025936
- Numbers m such that (1+i)^m + i is a Gaussian prime.at n=28A027206
- Number of partitions of n that do not contain 5 as a part.at n=31A027339
- 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 66.at n=4A031564
- Number of series-reduced dyslexic planted compound windmills with n leaves of 2 colors.at n=6A032293
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=26A034857
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 5).at n=42A035566
- Numbers whose maximal base-6 run length is 4.at n=27A037987
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 3.at n=12A038634
- Numbers having four 2's in base 6.at n=22A043380
- Numbers whose base-4 representation has exactly 7 runs.at n=22A043598
- Numbers k such that number of runs in the base 4 representation of k is congruent to 1 mod 6.at n=40A043838
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=22A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=22A043857