5973
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 2763
- 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
- 5973
- 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
- 23
- 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
- Expansion of e.g.f. exp(sin(x)).at n=12A002017
- From expansion of exp(sin x).at n=6A007301
- a(n) = n*(11*n - 1)/2.at n=33A022268
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=28A027917
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 7 generated by (1,2,...,7).at n=8A036728
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=25A046405
- Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.at n=12A052370
- Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.at n=24A052370
- Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 59,53,47,41,35,29,23,17,11 and 5 for r=1,3,5,..,19.at n=4A072253
- Number of walks of length n between non-adjacent nodes on the Petersen graph.at n=10A091002
- Inverse binomial transform of A026641; binomial transform of A127361.at n=10A127328
- 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, 0), (1, -1, 1), (1, 0, -1), (1, 0, 1)}.at n=8A148886
- Number of lines through at least 2 points of a 9 X n grid of points.at n=18A160849
- G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) / (1-x)^6.at n=14A162539
- a(n) = sqrt(sigma(2*m^2)), where m = A097023(n), i.e., sigma(2*m^2) is a square.at n=3A163764
- Numbers k for which 6k+1, 24k+5, 432k^2+72k-1, and 432k^2+90k-1 are all prime.at n=14A175513
- Odd numbers producing 5 odd numbers in the Collatz iteration.at n=29A198588
- Numbers k such that (2^k + k)*2^k + 1 is prime.at n=15A200823
- T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=47A200871
- Number of 0..n arrays x(0..4) of 5 elements without any interior element greater than both neighbors or less than both neighbors.at n=7A200873