4586
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6882
- Proper Divisor Sum (Aliquot Sum)
- 2296
- 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
- 2292
- Möbius Function
- 1
- Radical
- 4586
- 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
- 108
- 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
- A generalized partition function.at n=18A002598
- Coordination sequence T1 for Zeolite Code NON.at n=41A008212
- Numbers k such that the continued fraction for sqrt(k) has period 7.at n=33A010338
- Number of terms in 7th derivative of a function composed with itself n times.at n=7A022817
- Number of terms in n-th derivative of a function composed with itself 8 times.at n=7A024208
- Matrix 8th power of partition triangle A008284.at n=21A050302
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=18A061154
- Generating function: 1/((1-x)*(1-x^2)^2*(1-x^3)^3*(1-x^4)^4).at n=19A064349
- Convolution of the prime numbers with phi(n).at n=23A086734
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,0 2,1 3,0 3,1 4,1 5,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155374
- a(n) = 625n^2 - 364n + 53.at n=2A157621
- Number of permutations of 1..n v[1..n] with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=6A171339
- Antidiagonal triangle sequence based on recursion: f(n,a)=a*f(n-1,a)+n*f(n-2,a).at n=53A173004
- Number of n X 2 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=30A201347
- Number of (w,x,y) with all terms in {0,...,n} and w != min(|w-x|, |x-y|, |y-w|).at n=16A213492
- Numbers n such that Q(sqrt(n)) has class number 10.at n=22A218042
- Number of distinct values of the sum of i^2 over 8 realizations of i in 0..n.at n=24A225275
- Number of parts in all partitions of n into even number of distinct parts.at n=44A238132
- Number of partitions p of n such that (maximal multiplicity of the parts of p) = (maximal part of p).at n=48A240312
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part and max(p) - min(p) is a part.at n=40A241447