6879
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9176
- Proper Divisor Sum (Aliquot Sum)
- 2297
- 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
- 4584
- Möbius Function
- 1
- Radical
- 6879
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 150
- 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
- Number of plane partitions (or planar partitions) of n.at n=15A000219
- a(0) = 1, a(n) = 13*n^2 + 2 for n>0.at n=23A010004
- Cardinality of the permutation (k, k-1, ..., 2, 1)(n, n-1, ..., k+1) in an exchange shuffle applied in all n^n possible ways to (1,2,...,n).at n=8A013560
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=18A027847
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 54.at n=37A031552
- Numbers congruent to 2,3,6,11 mod 12 missing from A042944 (conjectured to be finite).at n=32A042945
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=33A056068
- Smallest k>n such that n^3+1 divides k*n^2+1.at n=19A071568
- If p(k) is the k-th prime, then the n-th set of 3 consecutive cousin prime pairs starts at p(a(n)).at n=18A095970
- Numbers n such that for some k there exist k numbers a1,a2, ...,ak that concatenations of them is equal to n and sum of them is equal to Pi(n).at n=13A097222
- Numbers k such that the k-th semiprime == 10 (mod k).at n=11A106135
- Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=26A110610
- Composite numbers k such that k+d+1 is prime for all divisors d of k greater than 1.at n=45A120776
- Number of partitions of n into "number of partitions of n into partition numbers" numbers.at n=42A130898
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, -1), (0, 1, 0), (1, -1, 0)}.at n=10A148132
- a(n) = prime(n)^3 + prime(n) + 1.at n=7A181150
- Number of strings of numbers x(i=1..6) in 0..n with sum i^2*x(i)^2 equal to n^2*36.at n=26A184244
- Maximum probability of permutation from bad "shuffle" times n^n.at n=8A192053
- a(0)=0, a(1)=1, a(2n)=19*a(n), a(2n+1)=a(2n)+1.at n=11A197353
- a(n)=a(n-1)+floor((a(n-2)+a(n-3))/2), with a(n)=n for n<3.at n=22A214040