3241
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3712
- Proper Divisor Sum (Aliquot Sum)
- 471
- 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
- 2772
- Möbius Function
- 1
- Radical
- 3241
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 167
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of primes < prime(n)^2.at n=39A000879
- Number of graphical basis partitions of 2n.at n=23A001130
- Squares written in base 7.at n=33A002440
- Coordination sequence T2 for Zeolite Code AFY.at n=47A008030
- Pseudoprimes to base 22.at n=26A020150
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=2A020417
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=24A030299
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 28 ones.at n=21A031796
- Concatenation of n and n + 9 or {n,n+9}.at n=31A032614
- OR-convolution of squares A000290 with themselves.at n=16A033459
- Number of partitions of n into parts 3k or 3k+1.at n=40A035360
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) < cn(2,5) = cn(4,5).at n=66A036867
- Coordination sequence T11 for Zeolite Code STT.at n=38A038429
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=29A039893
- Numbers n such that string 4,1 occurs in the base 10 representation of n but not of n-1.at n=35A044373
- Numbers n such that string 4,1 occurs in the base 10 representation of n but not of n+1.at n=35A044754
- a(n)=T(n,2), array T as in A049735.at n=32A049745
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 2,3,3.at n=13A049875
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=17A051400
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=24A053719