5582
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8376
- Proper Divisor Sum (Aliquot Sum)
- 2794
- 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
- 2790
- Möbius Function
- 1
- Radical
- 5582
- 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
- 67
- 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
- yes
- Odd
- no
Appears in sequences
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026703.at n=16A026713
- 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 74.at n=9A031572
- Numbers k such that 127*2^k+1 is prime.at n=16A032413
- Semiprimes a such that there exist three semiprimes b, c and d with a^3=b^3+c^3+d^3.at n=36A113490
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=13A117720
- Numbers k such that the decimal representation of k is contained as substring in that of the k-th triangular number.at n=8A119238
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=31A128215
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=2w+x+y<=1.at n=31A211620
- Number of distinct connected unicyclic bipartite graphs with n vertices.at n=12A214650
- Numbers k such that 3^k + 34 is prime.at n=26A219050
- a(n+1) is equal to a(n) plus the number of primes between a(n) and 2*a(n) inclusively.at n=46A220850
- Number of n-length words on {1,2,3,4} such that the maximal runs of identical odd integers are of odd length and the maximal runs of identical even integers are of even length.at n=10A242536
- Number of nX3 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than or equal to itself.at n=3A265962
- Number of nX4 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than or equal to itself.at n=2A265963
- T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than or equal to itself.at n=17A265965
- T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than or equal to itself.at n=18A265965
- G.f.: Product_{k>=1, j>=1} 1/(1 - x^(j*k^3)).at n=29A280661
- Number of maximal matchings in the n-gear graph.at n=11A287425
- Expansion of Product_{k>=2} (1 + x^Fibonacci(k))/(1 - x^Fibonacci(k)).at n=29A300414
- Expansion of Product_{k>=1} (1 - x^k)^q(k), where q(k) = number of partitions of k into distinct parts (A000009).at n=51A304783