3574
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5364
- Proper Divisor Sum (Aliquot Sum)
- 1790
- 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
- 1786
- Möbius Function
- 1
- Radical
- 3574
- 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
- 48
- 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
- Number of protruded partitions of n with largest part at most 3.at n=13A005404
- Coordination sequence T4 for Zeolite Code HEU.at n=39A008119
- Coordination sequence T9 for Zeolite Code MFI.at n=38A008172
- Numbers k such that the continued fraction for sqrt(k) has period 38.at n=40A020377
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.at n=35A024476
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000032, t = A023533.at n=34A025096
- a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A027052.at n=3A027081
- 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 58.at n=16A031556
- Coordination sequence T3 for Zeolite Code SBS.at n=47A033610
- Number of trees with 3-colored leaves.at n=9A036252
- Numbers having three 6's in base 8.at n=26A043447
- Numbers n such that string 7,4 occurs in the base 10 representation of n but not of n-1.at n=38A044406
- Numbers n such that string 7,4 occurs in the base 10 representation of n but not of n+1.at n=38A044787
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=13A049908
- Number of rooted trees with n nodes and 3 leaves.at n=18A055278
- Coordination sequence T2 for Zeolite Code SAS.at n=45A057313
- If n = D0*10^0 + D1*10^1 + D2*10^2 + .. + Dk*10^k define f(n) = D0*0^10 + D1*1^10 + D2*2^10 + .. + Dk*k^10 (e.g. if n = 421 then f(n) = 4*2^10 + 2*1^10 + 1*0^10 = 4098). Sequence gives values of n such that f(n) is divisible by n.at n=12A065110
- Lesser of two successive squarefree numbers whose product is not squarefree.at n=32A077395
- Indices of the primes in A095673: A095673(n) = prime(a(n)).at n=41A095650
- Semiprime function n -> A001358(n) applied four times to n.at n=31A105998