3974
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5964
- Proper Divisor Sum (Aliquot Sum)
- 1990
- 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
- 1986
- Möbius Function
- 1
- Radical
- 3974
- 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
- 95
- 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
- Erroneous version of A038119.at n=7A006986
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=41A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=41A007707
- Coordination sequence for Ni2In, Position Ni2.at n=19A009942
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=16A020389
- Length of n-th term of A022470.at n=28A022471
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (F(2), F(3), F(4), ...).at n=11A024878
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=17A025122
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=30A027575
- Sequence satisfies T^2(a)=a, where T is defined below.at n=52A027587
- Sequence satisfies T^2(a)=a, where T is defined below.at n=50A027590
- 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 62.at n=9A031560
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=25A034857
- Numbers whose base-5 representation contains exactly three 1's and two 4's.at n=21A045261
- Numbers n such that 213*2^n-1 is prime.at n=25A050858
- Smallest possible sum of n positive integers g(1) < g(2) < ... < g(n) such that A001222(g(i)+g(j)) = A001222(g(i)) + A001222(g(j)) for all 1<=i<j<=n.at n=8A059393
- a(n) = |{m : multiplicative order of 4 mod m=n}|.at n=44A059886
- Numerators of ordinary continued fraction convergents for 2*zeta(3).at n=6A060807
- Limits of diagonals in triangle defined in A061260.at n=10A061261
- a(1) = 1; a(n+1) = 1 + sum{k|n} a(k), sum is over the positive divisors, k, of n.at n=48A068336