4582
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 2618
- 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
- 2184
- Möbius Function
- -1
- Radical
- 4582
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 152
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=52A000009
- Exponentiation of e.g.f. for trees A000055(n-1).at n=7A006790
- Coordination sequence T2 for Zeolite Code EUO.at n=42A008097
- Expansion of 1/((1-x)^2*Product_{k>=1} (1-x^k)).at n=17A014153
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], where T is the array in A026386.at n=15A026397
- Number of ways to partition 2n into distinct positive integers.at n=26A035294
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) < cn(1,5).at n=53A036847
- Denominators of continued fraction convergents to sqrt(92).at n=10A041165
- Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).at n=24A047887
- Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.at n=48A047888
- Number of permutations in S_n with longest increasing subsequence of length <= 4.at n=7A047889
- a(n)=T(2n-1,n), array T given by A048212.at n=35A048221
- Duplicate of A047889.at n=6A052397
- Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196.at n=35A063049
- Number of ways to partition 4*n into distinct positive integers.at n=13A078406
- Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.at n=9A079941
- Expansion of q^(-1/24) (m (1-m) / 16)^(1/24) in powers of q, where m = k^2 is the parameter and q is the nome for Jacobian elliptic functions.at n=52A081360
- Number of 3 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (10;0) and (10;1).at n=9A099041
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 7 multiples of n-1, n-2, ..., 1, for n>=1.at n=37A113744
- Number of partitions of n into odd parts in which the largest part occurs only once.at n=53A117409