3572
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 6720
- Proper Divisor Sum (Aliquot Sum)
- 3148
- 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
- 1656
- Möbius Function
- 0
- Radical
- 1786
- Omega Function (Ω)
- 4
- 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
- 74
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=47A000601
- a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=17A001612
- Number of n-digit reversible primes (or emirps) with distinct digits.at n=6A003684
- a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.at n=1A004972
- Number of restricted circular combinations.at n=15A006499
- Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=16A007039
- Coordination sequence T2 for Zeolite Code VFI.at n=46A008246
- Coordination sequence T2 for Milarite.at n=37A008257
- Coordination sequence T6 for Zeolite Code TER.at n=40A016438
- Least m such that if r and s in {-F(2*h) + phi*F(2*h-1): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and phi = (1+sqrt(5))/2 (golden ratio).at n=8A024851
- Coordination sequence T3 for Zeolite Code IFR.at n=42A024984
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=21A025102
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=34A025200
- Numbers that are the sum of 4 positive cubes in exactly 3 ways.at n=31A025405
- Numbers that are the sum of 4 positive cubes in 3 or more ways.at n=33A025407
- Numbers that are the sum of 4 distinct positive cubes in exactly 3 ways.at n=7A025410
- Numbers that are the sum of 4 distinct positive cubes in 3 or more ways.at n=7A025413
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=8A027603
- Every run of digits of n in base 3 has length 2.at n=19A033001
- Number of partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=33A035963