8602
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 6950
- 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
- 3520
- Möbius Function
- 1
- Radical
- 8602
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 26
- 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
- a(n) = n*(n+5)*(n+6)*(n+7)/24.at n=17A005587
- Coordination sequence for MgNi2, Position Mg2.at n=23A009935
- Expansion of Product_{k>=1} (1 - x^k)^17.at n=8A010823
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=43A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=42A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=42A024868
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=43A026052
- Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...at n=44A062708
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=36A064026
- Numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n+1))).at n=30A090177
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 43.at n=2A093243
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 86.at n=2A093286
- A number triangle of lattice walks.at n=50A107842
- Triangle, read by rows, defined by: T(n,k) = (4*k+1)*binomial(2*n+1, n-2*k)/(2*n+1) for n >= 2*k >= 0.at n=46A119245
- a(n) = C(2^n + 2*n + 1, n)*(2^n + 1)/(2^n + 2*n + 1); a(n) = coefficient of x^n in Catalan(x)^(2^n+1).at n=4A136551
- a(n) = denominator((1/2)*(1 + Product_{k=0..n-1} 2*(1 + 3*k)/(5 + 6*k))).at n=4A146753
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (-1, 0, 1), (0, 1, 0), (1, -1, 0)}.at n=10A148283
- 11 times pentagonal numbers: 11*n*(3n-1)/2.at n=23A153449
- Sum_{j=k(n)..prime(n)} j where k is the n-th nonprime nonnegative integer.at n=33A161669
- a(n) = n * A056219(n+1).at n=22A166869