5079
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6776
- Proper Divisor Sum (Aliquot Sum)
- 1697
- 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
- 3384
- Möbius Function
- 1
- Radical
- 5079
- 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
- 178
- 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
- Number of n-node rooted trees of height 7.at n=13A000418
- Coordination sequence T1 for Zeolite Code ANA.at n=46A008031
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=24A020393
- Fibonacci sequence beginning 4, 11.at n=14A022131
- Number of partitions of n into 7 unordered relatively prime parts.at n=38A023027
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=3.at n=14A024947
- a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026568.at n=9A026582
- 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 46.at n=31A031544
- Number of partitions of n into parts 4k+1 or 4k+2.at n=47A035365
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(1,5) <= cn(3,5) = cn(4,5).at n=68A036848
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=27A045127
- Numbers k such that 285*2^k-1 is prime.at n=33A050901
- Engel expansion of Sum_{k>=0} 1/(4 + k)^k.at n=7A063187
- Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=33A102425
- Expansion of g.f. Product_{k>=1} 1/(1-x^sigma(k)).at n=43A111865
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...).at n=51A124574
- Location of record values in A080577; also partial sums of A006128 plus 1.at n=16A124920
- Semiprimes s such that s-/+2 are primes.at n=31A125215
- 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=33A128279
- Square array a(m,n) read by antidiagonals, where a(m,n) is the number of ways to move a chess queen from the lower left corner to square (m,n), with the queen moving only up, right, or diagonally up-right.at n=49A132439