4304
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 8370
- Proper Divisor Sum (Aliquot Sum)
- 4066
- 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
- 2144
- Möbius Function
- 0
- Radical
- 538
- Omega Function (Ω)
- 5
- 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
- 33
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = a(n-1) + a(n - 1 - number of even terms so far).at n=35A006336
- Coordination sequence T5 for Zeolite Code HEU.at n=43A008120
- Molien series for A_6.at n=40A008629
- Expansion of log(1+sin(x))*cosh(x).at n=9A009333
- Coordination sequence T1 for Zeolite Code ZON.at n=46A009919
- Binomial transform of Thue-Morse sequence A010059.at n=13A019301
- Expansion of (theta_3(z)*theta_3(9z)+theta_2(z)*theta_2(9z))^4.at n=29A028604
- Coordination sequence T3 for Zeolite Code AWO.at n=45A038405
- Numbers whose base-4 representation contains exactly four 0's and two 1's.at n=28A045035
- a(n) = A055993(n) - A034444(A056627(n)).at n=27A056630
- a(n) = A055993(n) - A034444(A056627(n)).at n=28A056630
- Triangle of numbers arising in recursive computation of A002212.at n=33A073149
- Expansion of 1 / AGM(1, 1 - 8*x) in powers of x.at n=5A081085
- Solution to the merit factor problem.at n=62A091386
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LUR] (when read digit-by-digit).at n=47A093104
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [URL] (when read digit-by-digit).at n=49A093105
- Number of subsets A of {1..n} such that there are no solutions to a+b+c=d for a,b,c,d in A.at n=16A093970
- Number of unlabeled 4-gonal 2-trees with n 4-gons.at n=8A094610
- Number of distinct values of i*j + j*k + k*i with 1 <= i<j<k <= n.at n=46A100439
- a(n) = 100*n + 4.at n=43A102439