6083
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7680
- Proper Divisor Sum (Aliquot Sum)
- 1597
- 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
- 4680
- Möbius Function
- -1
- Radical
- 6083
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- 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
- a(n) = 4*n^2 - 1.at n=39A000466
- a(n) = (4*n+1)*(4*n+3).at n=19A001539
- Coordination sequence T2 for Coesite.at n=41A008268
- Pseudoprimes to base 78.at n=23A020206
- Convolution of the lower and upper Wythoff sequences (A000201 and A001950).at n=19A023664
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=36A027662
- Quasi-Carmichael numbers to base 3: squarefree composites n such that prime p|n ==> p-3|n-3.at n=3A029560
- a(n) = floor((n^3)/2).at n=23A036487
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=44A036807
- Number of positive squarefree integers less than 10^n.at n=4A053462
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.at n=42A053721
- Number of squarefree integers <= 10^n.at n=4A071172
- Antidiagonal sums of table A083050.at n=15A083053
- Scaled array A078740 ((3,2)-Stirling2).at n=30A090452
- Sixth column (m=7) of array A090452.at n=2A091027
- n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[k] a prime.at n=33A114234
- Number of partitions of n-1 boys and one girl with no couple.at n=24A120452
- Positive numbers of the form 4*n^2 - 1 which are not semiprimes.at n=30A123754
- Number of base 7 n-digit numbers with adjacent digits differing by three or less.at n=5A126475
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k LL's (n >= 0; 0 <= k <= n-2 for n >= 2).at n=41A128724