3629
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3840
- Proper Divisor Sum (Aliquot Sum)
- 211
- 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
- 3420
- Möbius Function
- 1
- Radical
- 3629
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 56
- 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
- a(n) = n*(5*n+1)/2.at n=38A005475
- Number of n-covers of an unlabeled 3-set.at n=9A005745
- Coordination sequence T1 for Zeolite Code KFI.at n=46A008123
- A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.at n=45A011185
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(5,26).at n=4A022032
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=31A024932
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a prime.at n=32A032695
- Composite numbers whose prime factors contain no digits other than 1 and 9.at n=7A036309
- Coordination sequence T9 for Zeolite Code STT.at n=40A038424
- Number of partitions satisfying 0 < cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(4,5) + cn(2,5) + cn(3,5).at n=28A039901
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=7A045216
- Squarefree nonprimes with property that the concatenation of the prime factors is a palindrome.at n=32A046448
- Semiprimes whose prime factors, when concatenated, yield a palindrome.at n=31A046451
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=29A050967
- a(n) = 10*n^2+n.at n=18A055437
- Composite numbers whose divisors (except 1) all contain the digit 9.at n=2A062680
- The minimal number which has multiplicative persistence 5 in base n.at n=1A064869
- Column 2 of the array m(i,1)=m(1,j)=1 m(i,j)=m(i-1,j-1)+m(i-1,j+1) (a(n)=m(n,2)).at n=14A072100
- 5th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).at n=5A081182
- Numbers n such that the Zsigmondy number Zs(n,5,1) differs from the n-th cyclotomic polynomial evaluated at 5.at n=45A093109