3551
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3672
- Proper Divisor Sum (Aliquot Sum)
- 121
- 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
- 3432
- Möbius Function
- 1
- Radical
- 3551
- 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
- 87
- 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
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)).at n=20A005468
- Coordination sequence T1 for Zeolite Code -WEN.at n=43A009862
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=13A010011
- a(n) = Sum_{k=0..floor(n/2)} A026626(n, k).at n=12A026634
- Numbers whose base-4 representation has 4 fewer 0's than 3's.at n=34A031469
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 11 ones.at n=9A031779
- a(n) = n-th prime number * n-th lucky number.at n=15A032601
- Coordination sequence T1 for Zeolite Code SBE.at n=48A033604
- Number of partitions of n into parts not of the form 13k, 13k+2 or 13k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 5 are greater than 1.at n=34A035950
- Sums of 10 distinct powers of 2.at n=24A038461
- a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=15A038771
- Numbers having, in base 15, (sum of even run lengths)=(sum of odd run lengths).at n=24A044886
- Numbers whose base-4 representation contains no 0's and exactly four 3's.at n=33A045065
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=6A045123
- Numbers whose base-4 representation contains no 2's and exactly four 3's.at n=31A045137
- n-th 6k+1 prime times n-th 6k-1 prime.at n=7A048629
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=11A050781
- Numbers k such that phi(sigma(k^3)) is a square.at n=42A063796
- Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=18A073603
- Reflected (see A074058) pentanacci numbers A074048.at n=37A074062