3585
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 2175
- 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
- 1904
- Möbius Function
- -1
- Radical
- 3585
- 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
- 74
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 8 positive 9th powers.at n=7A003397
- a(n) = round(1000*log_2(n)).at n=11A004266
- a(n) = ceiling(1000*log_2(n)).at n=11A004267
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=43A007664
- Coordination sequence T1 for Milarite.at n=37A008256
- Pseudoprimes to base 38.at n=28A020166
- Pseudoprimes to base 44.at n=29A020172
- Pseudoprimes to base 98.at n=31A020226
- Expansion of Product_{m>=1} (1+x^m)^7.at n=7A022572
- Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed).at n=42A023108
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=20A024972
- Numbers having period-1 7-digitized sequences.at n=20A031201
- Shifts left 2 places under "DHK" (bracelet, identity, unlabeled) transform.at n=16A032258
- Numbers whose set of base-14 digits is {1,4}.at n=20A032826
- Numbers whose set of base-7 digits is {1,3}.at n=42A032914
- Multiplicity of highest weight (or singular) vectors associated with character chi_65 of Monster module.at n=35A034453
- Denominators of continued fraction convergents to sqrt(555).at n=8A042063
- a(n)=(s(n)+1)/8, where s(n)=n-th base 8 palindrome that starts with 7.at n=18A043071
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n-1.at n=38A044417
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n+1.at n=38A044798