8202
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 8214
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2732
- Möbius Function
- -1
- Radical
- 8202
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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
- First differences of A005579.at n=21A005347
- Distinct perimeter lengths of polygons with regularly spaced vertices.at n=12A007874
- Expansion of Product_{m>=1} (1+m*q^m)^-12.at n=8A022704
- Numbers whose base-4 representation contains exactly four 0's and no 1's.at n=22A045033
- Numbers whose base-4 representation contains exactly four 0's and three 2's.at n=0A045060
- a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=39A085688
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=31A109730
- A106486-encodings of combinatorial games with value -1.at n=17A125993
- a(n) = 2*a(n-1) + 3*a(n-2), with a(0) = 2 and a(1) = 3.at n=8A135522
- a(n+1) = 9*a(n) - 6, a(0) = 2.at n=4A137483
- Partial sums of A000051, starting at n=1.at n=11A145071
- First differences of A145646.at n=3A145647
- 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), (0, 0, -1), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=9A149076
- 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, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150692
- Sums of 3 consecutive semiprimes.at n=36A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=34A173969
- Numbers 1 through 10000 sorted lexicographically in binary representation.at n=31A190126
- G.f. A(x) satisfies A(A(x))=(1-4*x-sqrt(1-8*x))/(8*x).at n=7A199822
- 1/4 the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=24A209725
- Denominators of Bernoulli numbers which are congruent to 3 (mod 9).at n=42A219543