5006
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7512
- Proper Divisor Sum (Aliquot Sum)
- 2506
- 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
- 2502
- Möbius Function
- 1
- Radical
- 5006
- 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
- 64
- 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
- Number of compositions of n into a sum of odd primes.at n=39A002124
- Coordination sequence T2 for Zeolite Code MFS.at n=44A008174
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=13A020419
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).at n=21A024464
- n written in fractional base 10/5.at n=46A024660
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).at n=20A025084
- 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 70.at n=8A031568
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 30 ones.at n=39A031798
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=35A033951
- Coefficients of cluster series for site percolation problem on b.c.c. lattice with 1st, 2nd and 3rd neighbor bonds.at n=3A036401
- Number of ternary rooted trees with n nodes and height exactly 7.at n=14A036422
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=43A050057
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=27A054222
- Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n.at n=3A071555
- Interprimes (A024675) which are of the form s*prime, s=2.at n=37A075277
- 1-1, 2*3-(2+3), 4*5*6-(4+5+6), 7*8*9*10-(7+8+9+10), ...at n=3A075350
- Sum of generalized tribonacci numbers A001644 and inverted tribonacci numbers A075298.at n=14A075418
- Pascal-(1,6,1) array.at n=41A081581
- Pascal-(1,6,1) array.at n=39A081581
- a(n) = floor((Sum_{r=1..n} r)*(Sum_{r=1..n} 1/r)).at n=46A090541