6085
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7308
- Proper Divisor Sum (Aliquot Sum)
- 1223
- 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
- 4864
- Möbius Function
- 1
- Radical
- 6085
- 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
- 111
- 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
- Crystal ball sequence for {E_6}* lattice.at n=3A008402
- Sum along upward diagonal of Pascal triangle from (but not including) center.at n=24A010756
- Pseudoprimes to base 78.at n=24A020206
- Strong pseudoprimes to base 78.at n=12A020304
- a(n) = T(n, 2*n-6), T given by A027926.at n=12A027929
- "BFK" (reversible, size, unlabeled) transform of 1,2,3,4...at n=14A032045
- "BGK" (reversible, element, unlabeled) transform of 1,0,1,0,...at n=51A032059
- Number of partitions satisfying cn(1,5) + cn(4,5) < cn(0,5) + cn(2,5) + cn(3,5).at n=34A039868
- Sum of the first n palindromes (A002113).at n=42A046489
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=22A049737
- Values of n^2 + 1 resulting from A050796.at n=44A050800
- Partial sums of A053308.at n=6A053309
- a(n) = 4*n^2 + 1.at n=39A053755
- a(n) = T(n,n-6), array T as in A055801.at n=25A055806
- Engel expansion of e^Pi = 23.14069... .at n=30A059196
- Partial sums of A084570.at n=18A084569
- Numbers n such that 5*10^n + 4*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=21A103016
- Composite number of the form 4n^2+1.at n=23A121944
- Iterates of A122237, starting from 5.at n=6A122244
- A137576((k-1)/2) for composite numbers k from A141229.at n=3A140197