8252
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14448
- Proper Divisor Sum (Aliquot Sum)
- 6196
- 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
- 4124
- Möbius Function
- 0
- Radical
- 4126
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- 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
- Numbers whose base-4 representation contains exactly four 0's and no 1's.at n=33A045033
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=22A045083
- Revert transform of (1 - 3x + x^3)/(1 - 2x - 2x^2).at n=8A049136
- Number of chiral non-crossing partition patterns of n points on a circle, divided by 2.at n=11A111276
- 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, 1, -1), (1, -1, 0), (1, 0, -1), (1, 0, 1)}.at n=9A148603
- 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, 1, 1), (0, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150449
- Number of 1-sided strip polypons with n cells.at n=27A151532
- Values n such that n and n+1 are both in A037073.at n=28A173167
- Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.at n=38A224667
- A070952(2^n-1).at n=13A246597
- Numbers k such that [r[s*k]] - [s[r*k]] = -2, where r = sqrt(2), s=sqrt(3), and [ ] = floor.at n=39A259584
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=7A260287
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=28A260294
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=35A260294
- Numbers n such that the arithmetic derivative of the totient(n) is equal to the cototient(n).at n=46A272528
- a(n) = 1 + Sum_{k=0..floor((n-1)/2)} a(k) * a(n-2*k-1).at n=14A351972
- G.f. satisfies A(x) = 1 + x*A(x) / (1 - x^5*A(x)^3).at n=17A365735
- a(n) = Sum_{k=1..n} (-1)^(k-1) * binomial(floor(n/k)+2,3).at n=36A366395
- Index where prime(n) appears as a term in A379442.at n=35A379558