5673
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7936
- Proper Divisor Sum (Aliquot Sum)
- 2263
- 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
- 3600
- Möbius Function
- -1
- Radical
- 5673
- 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
- 204
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = ceiling(tan(n)^2).at n=33A005699
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17).at n=50A017866
- 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 50.at n=21A031548
- Initial number for record sum of numbers in trajectory of 3x+1 problem.at n=28A033495
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=44A035546
- a(n)=T(n,n+2), array T as in A049735.at n=29A049742
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=27A063052
- Numbers that are sums of divisors of the odd squares; Intersection of A065764 and A065766, written in ascending order and duplicates removed.at n=34A065768
- Number of n X n 0..2 matrices with all row and column sums equal.at n=4A067210
- Beginning with 1, numbers such that the differences a(k)-a(k-1) are distinct and every concatenation n>1 is prime.at n=37A090504
- 3 times hexagonal numbers: a(n) = 3*n*(2*n-1).at n=31A094159
- Number of 4k+3 integers in range [2^n, 2^(n+1)] whose Jacobi-vector is not a valid Motzkin-path (A095101).at n=14A095091
- Connell (3,2)-sum sequence (partial sums of the (3,2)-Connell sequence).at n=64A122794
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=24A124636
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A149860
- Numbers n with property that A100486(n) is square.at n=39A156913
- 3 times centered triangular numbers: 9*n*(n+1)/2 + 3.at n=35A164013
- Sum of the numbers between k := n-th nonprime and 2k (like a jump in a Sieve of Eratosthenes).at n=43A179896
- Number of distinct solutions of Sum_{i=1..2} (x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.at n=33A180773
- T(n,k) is the number of n X n 0..k arrays with row and column sums equal.at n=25A202784