3206
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
- 8
- Divisor Sum
- 5520
- Proper Divisor Sum (Aliquot Sum)
- 2314
- 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
- 1368
- Möbius Function
- -1
- Radical
- 3206
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 61
- 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) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6.at n=39A005709
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=37A006950
- Second (lower) diagonal of partition triangle A047812.at n=11A007045
- Coordination sequence T1 for Zeolite Code EPI.at n=36A008090
- Coordination sequence T1 for Zeolite Code MFS.at n=35A008173
- Coordination sequence for CaF2(1), Ca position.at n=19A009923
- Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x.at n=50A011117
- Expansion of 1/(1 - x^7 - x^8 - ...).at n=46A017901
- n written in fractional base 7/3.at n=55A024640
- a(n) = (d(n)-r(n))/5, where d = A026063 and r is the periodic sequence with fundamental period (1,4,0,0,0).at n=35A026065
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) <= cn(3,5).at n=65A036870
- Numbers k such that the string 5,2 occurs in the base 9 representation of k but not of k-1.at n=43A044298
- Numbers n such that string 0,6 occurs in the base 10 representation of n but not of n-1.at n=34A044338
- Numbers n such that string 0,6 occurs in the base 10 representation of n but not of n+1.at n=34A044719
- Numbers whose base-5 representation contains exactly two 0's and three 1's.at n=13A045168
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049747.at n=21A049748
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 24.at n=20A051989
- Numbers n such that n^2 contains exactly 8 different digits.at n=0A054036
- a(n)^2 is the least square to contain n different decimal digits.at n=7A054039
- a(n) = T(n,n-5), array T as in A055807.at n=11A055810