4342
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 2714
- 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
- 1992
- Möbius Function
- -1
- Radical
- 4342
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 51
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Coordination sequence T2 for Zeolite Code NES.at n=42A008206
- Coordination sequence T3 for Zeolite Code ITE.at n=45A027371
- Numbers k such that 75*2^k-1 is prime.at n=35A050563
- Number of step shifted (decimated) sequences using exactly two different symbols.at n=14A056376
- Harmonic mean of digits is 3.at n=37A062181
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.at n=32A067335
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.at n=31A067356
- a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.at n=48A069203
- a(n) = Sum_{k=1..n-1} gcd(k,n)*a(k), a(1) = 1.at n=11A072979
- Numbers k such that k^4 has k as a substring of its decimal expansion.at n=36A075904
- Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).at n=22A076660
- Expansion of theta_3(q) / theta_3(q^2) in powers of q.at n=32A080015
- G.f.: Product_{n >= 0} (1+x^(2n+1))/(1-x^(2n+1)).at n=32A080054
- a(n)=number of Catalan knight paths in Quadrant I from (0,0) to points on the vertical line x=n. A Catalan knight moves (2 right and 1 up) or (1 right and 1 down).at n=10A096588
- Number of partitions of the n-th abundant number into abundant numbers.at n=48A097800
- a(n)= 3*a(n-1) +2*a(n-2) +a(n-3).at n=8A108152
- Expansion of f(-q) / f(q) in powers of q where f() is a Ramanujan theta function.at n=32A108494
- Start with 1 and repeatedly reverse the digits and add 60 to get the next term.at n=29A118162
- Start with 1 and repeatedly reverse the digits and add 30 to get the next term.at n=34A118637
- Numbers k such that tau(k) = tau(k+1) mod 691, where tau is Ramanujan's tau function A000594.at n=4A121733