3571
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3572
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 3570
- Möbius Function
- -1
- Radical
- 3571
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 30
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 500
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.at n=16A000204
- Associated Mersenne numbers.at n=17A001350
- Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=33A001578
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=18A001583
- A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=17A001638
- a(n) = Lucas(5*n+2).at n=3A001947
- Cuban primes: primes which are the difference of two consecutive cubes.at n=18A002407
- Bisection of Lucas sequence: a(n) = L(2*n+1).at n=8A002878
- Hex (or centered hexagonal) numbers: 3*n*(n+1)+1 (crystal ball sequence for hexagonal lattice).at n=34A003215
- Numbers k such that 4!*(2k-5)!/(k!*(k-1)!) is an integer.at n=35A004784
- 5!(2n-6)!/n!(n-1)! is an integer.at n=40A004785
- a(n) = floor(n*phi^17), where phi is the golden ratio, A001622.at n=1A004932
- a(n) = round(n*phi^17), where phi is the golden ratio, A001622.at n=1A004952
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=17A005013
- Prime Lucas numbers (cf. A000032).at n=9A005479
- Coordination sequence T2 for Zeolite Code DAC.at n=38A008068
- Coordination sequence T11 for Zeolite Code MFI.at n=38A008163
- Coordination sequence T3 for Zeolite Code MFI.at n=38A008166
- Coordination sequence T6 for Zeolite Code MFI.at n=38A008169
- Coordination sequence T7 for Zeolite Code MFI.at n=38A008170