5020
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 5564
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2000
- Möbius Function
- 0
- Radical
- 2510
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 90
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Denominators of greedy Egyptian fraction expansion of Pi - 3.at n=2A001466
- Smaller of an amicable pair: (a,b) such that sigma(a) = sigma(b) = a+b, a < b.at n=3A002025
- Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=25A003411
- Coordination sequence T1 for Zeolite Code EUO.at n=44A008095
- Second diagonal of A027537.at n=7A027540
- Triangle read by rows: T(n,k)=A(n,k)*binomial(n+k-1,n), where A(n,k) are the Eulerian numbers (A008292).at n=37A038675
- Denominators of continued fraction convergents to sqrt(630).at n=3A042209
- Partial sums of A045954.at n=47A045964
- Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=21A054736
- Amicable numbers.at n=6A063990
- Rounded volume of a regular octahedron with edge length n.at n=22A071400
- Expansion of exp(2x) - exp(0) + BesselI_0(2x).at n=12A081672
- Expansion of q^(-1/6) * eta(q^2)^3 / eta(q)^2 in powers of q.at n=42A085140
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A073288/A073289.at n=11A089405
- Number of partitions of n such that the number of different parts is odd.at n=32A090794
- Euler-Seidel matrix T(k,n) with start sequence A001147, read by antidiagonals.at n=57A099020
- Sliding numbers: totals, including repetitions, of sums r + s, r >= s, such that 1/r + 1/s = (r + s)/10^k for some k >= 0.at n=45A103182
- Expansion of (1 - x + x^2)/(1 - x - x^4).at n=29A103632
- a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix P^n + T^n, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1].at n=28A109526
- Self-describing sequence. See the sequence as a succession of digits: then a(n) is the position of a composite digit in the sequence.at n=52A114318