6279
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 4473
- 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
- 3168
- Möbius Function
- 1
- Radical
- 6279
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 106
- 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
- Number of multigraphs with 4 nodes and n edges.at n=25A003082
- Number of subsequences of [ 1,...,n ] in which each odd number has an even neighbor.at n=14A007455
- Number of subsequences of [ 1,...,n ] in which each even number has an odd neighbor.at n=14A007481
- a(n) is the number of subsequences of [ 1, ..., 2n ] in which each odd number has an even neighbor.at n=7A007482
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=24A013593
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=25A024590
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=24A025104
- Product of n with 666 is palindromic.at n=41A030094
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=34A046390
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=35A049454
- a(n) = n(n+7)(n+1)(n^2+2n+12)/120.at n=12A051746
- Numbers that are unchanged when turned upside down, when written in a font in which 7 looks like upside-down 2.at n=43A051791
- a(n) = (4*n^2 + 2*n - 3)*(2*n - 1)*n/3.at n=7A058581
- a(n) = 3*n*(4*n-1).at n=23A062783
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.at n=8A071141
- Numbers n such that (i) the sum of the distinct primes dividing n is divisible by the largest prime dividing n and (ii) n has exactly 4 distinct prime factors and (iii) n is squarefree.at n=1A071143
- Squarefree numbers k such that the largest prime factor of k is equal to the sum of the other prime factors of k.at n=8A071312
- Squarefree numbers having exactly three prime gaps.at n=29A073489
- Numbers having exactly three prime gaps in their factorization.at n=34A073495
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=15A075764