5817
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8896
- Proper Divisor Sum (Aliquot Sum)
- 3079
- 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
- 3312
- Möbius Function
- -1
- Radical
- 5817
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- no
- Odd
- yes
Appears in sequences
- Euler transform of A000332.at n=7A000391
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...).at n=11A025103
- Cube root of A030697.at n=26A030698
- 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=27A031548
- Denominators of continued fraction convergents to sqrt(696).at n=9A042339
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=29A050035
- Triangle of coefficients of polynomials arising in enumeration of periodic sequences.at n=59A054722
- Interprimes (A024675) which are of the form s*prime, s=21.at n=19A075296
- Triangle read by rows: T(n, k) is the number of primitive (period n) n-bead necklace structures with k different colors. Only includes structures that contain all k colors.at n=61A107424
- Numbers of the form m = p1 * p2 * p3 where for each d|m we have (d+m/d)/2 prime and p1 < p2 < p3 each prime.at n=30A128284
- Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations.at n=61A152175
- The sequence is a lattice filling using the Golden Ratio, (Sqrt[5]+1)/2, constant digits base ten.at n=3A152183
- Similar to A072921 but starting with 3.at n=31A152232
- Antidiagonal sums of A163280.at n=20A163983
- a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.at n=26A175254
- Triangle t(n,m,k) = binomial(n, m) - k*(binomial(n, m)*binomial(n+1, m)/(m+1)) + k*Eulerian(n+1, m) with k = 6.at n=46A178347
- Difference between 10^n and the first prime of gap 6 > 10^n.at n=44A227435
- Composite numbers whose sum of aliquot parts divides the sum of the aliquot parts of the numbers less than or equal to n and not relatively prime to n.at n=14A249109
- Number of (n+1) X (2+1) 0..1 arrays with no 2 X 2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=3A251094
- Number of (n+1)X(4+1) 0..1 arrays with no 2X2 subblock having its minimum diagonal element less than its minimum antidiagonal element.at n=1A251096