3805
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4572
- Proper Divisor Sum (Aliquot Sum)
- 767
- 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
- 3040
- Möbius Function
- 1
- Radical
- 3805
- 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
- 30
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of convergents to cube root of 4.at n=10A002356
- Solution to Pellian: y such that x^2 - n*y^2 = +-1.at n=60A006703
- Coordination sequence T2 for Zeolite Code STI.at n=42A008235
- Coordination sequence T2 for Zeolite Code -ROG.at n=46A009860
- Sum along upward diagonal of Pascal triangle to center.at n=18A010752
- Expansion of x/(1 - 7*x - 9*x^2).at n=5A015566
- Pseudoprimes to base 39.at n=12A020167
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=27A025001
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m=[ (n+1)/2 ], T given by A026725.at n=12A026847
- a(n) = Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026681.at n=4A026989
- Number of polyhexes of class PF2.at n=6A030534
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 5).at n=47A035575
- Coordination sequence T2 for Zeolite Code STT.at n=41A038423
- Path-counting triangular array T(i,j), read by rows, obtained from array t in A038792 by T(i,j) = t(2*i-j, j) (for i >= 1 and 1 <= j <= i).at n=51A038730
- T(n,n-3), array T as in A038730.at n=6A038732
- T(n,n-6), array T as in A038792.at n=12A038796
- T(2n+6,n), array T as in A038792.at n=6A038799
- Denominators of continued fraction convergents to sqrt(61).at n=10A041107
- Denominators of continued fraction convergents to sqrt(244).at n=12A041457
- Denominators of continued fraction convergents to sqrt(549).at n=8A042051