2334
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4680
- Proper Divisor Sum (Aliquot Sum)
- 2346
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 776
- Möbius Function
- -1
- Radical
- 2334
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=26A000837
- Coordination sequence T2 for Zeolite Code APD.at n=32A008035
- Coordination sequence T1 for Zeolite Code EPI.at n=30A008090
- Coordination sequence T2 for Zeolite Code MTN.at n=29A008187
- Coordination sequence T4 for Zeolite Code -CHI.at n=31A009849
- Coordination sequence T2 for Zeolite Code CON.at n=34A009869
- Length of n-th term of A022470.at n=26A022471
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=20A023177
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=42A024696
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=27A025056
- a(n) = sum of the numbers between the two n's in A026358.at n=24A026361
- Sequence satisfies T^2(a)=a, where T is defined below.at n=46A027587
- Numbers k such that Hofstadter Q-sequence Q(k) (A005185) satisfies Q(k) = k/2.at n=31A027619
- Numbers k such that 49*2^k+1 is prime.at n=11A032374
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=60A036865
- Numbers n such that string 7,3 occurs in the base 9 representation of n but not of n-1.at n=31A044317
- Numbers n such that string 3,4 occurs in the base 10 representation of n but not of n-1.at n=25A044366
- Numbers n such that string 7,3 occurs in the base 9 representation of n but not of n+1.at n=31A044698
- Numbers n such that string 3,4 occurs in the base 10 representation of n but not of n+1.at n=25A044747
- Numbers whose base-3 representation contains exactly three 0's and four 1's.at n=35A044984