5979
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7976
- Proper Divisor Sum (Aliquot Sum)
- 1997
- 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
- 3984
- Möbius Function
- 1
- Radical
- 5979
- 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
- 54
- 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
- Molien series for A_7.at n=39A008630
- 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=34A031548
- Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=72A036875
- Numerators of continued fraction convergents to sqrt(358).at n=8A041678
- Partial sums of the sequence (A001097) of twin primes.at n=40A048598
- Numbers n such that 25*2^n-1 is prime.at n=24A050538
- Number of positive integers <= 2^n of the form x^2 + 5*y^2.at n=15A054150
- C(n+3)=2*C(n), where C(n) is Cototient(n) := n - phi(n) (A051953).at n=36A063480
- a(1) = 9; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A074345
- Numbers n such that 4*10^n + 5*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=11A102993
- Cascadence of (1+x)^3; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0.at n=37A120919
- an=n-th smallest integer of the form m=p1*p2 where pi are odd primes such that d+2m/d are all primes for d dividing 2m.at n=40A128279
- Numbers n such that n^k+(n+1)^k is prime for k = 1, 2, 4.at n=36A128780
- Numbers k that divide 3^((k-1)/2) - 2^((k-1)/2) - 1.at n=42A130061
- 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), (1, 0, -1), (1, 1, 0)}.at n=8A148950
- Let c(n) = x^(2^n-1)*(1-x^(2^n)), g(n) = 1 + x^(2^n-1) + x^(2^n), h(n) = Product_{i=1..n} g(i); then use g.f. (1+2*x) - Sum_{n>=1} c(n)/h(n).at n=61A151684
- Vertex number of a rectangular spiral related to prime numbers. The distances between nearest edges of the spiral that are parallel to the initial edge are the prime numbers, while the distances between nearest edges perpendicular to the initial edge are all one.at n=45A160792
- a(n) = count of monomials, degree k=0 to n, in the power sum symmetric polynomials m(mu,k) summed over all partitions mu of n.at n=5A209665
- Number of partitions of n containing at least one part m-5 if m is the largest part.at n=31A212545
- Rectangular array: (row n) = b**c, where b(h) = 2*h-1, c(h) = -1 + 2^(n-1+h), n>=1, h>=1, and ** = convolution.at n=46A213753