3522
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 3534
- 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
- 1172
- Möbius Function
- -1
- Radical
- 3522
- 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
- 105
- 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
- Generalized Euler numbers, c(5,n).at n=2A000187
- Generalized class numbers c_(n,2).at n=4A000362
- Convolved Fibonacci numbers.at n=10A001628
- Cluster series for honeycomb.at n=15A003204
- Numbers m such that 4*3^m + 1 is prime.at n=15A005537
- Coordination sequence for Paracelsian.at n=40A008260
- Number of (unordered) triples of integers from [1,n] with no common factors between pairs.at n=41A015617
- Number of triples of different integers from [ 2,n ] with no common factors between pairs.at n=41A015620
- Numbers k such that Fibonacci(k) == -8 (mod k).at n=37A023166
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=50A024696
- [ Sum{(sqrt(j+1)-sqrt(i+1))^3} ], 1 <= i < j <= n.at n=29A025223
- Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.at n=51A027189
- 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 58.at n=13A031556
- Bisection of A028289.at n=34A038390
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 4.at n=7A038635
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=31A039894
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n-1.at n=35A044354
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n+1.at n=35A044735
- Triangles in open triangular matchstick arrangement (triangle minus one side) of side n.at n=24A045947
- 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 k values.at n=29A054223