6878
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 4042
- 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
- 3240
- Möbius Function
- -1
- Radical
- 6878
- 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
- 150
- 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
- yes
- Odd
- no
Appears in sequences
- Number of zeros in character table of symmetric group S_n.at n=13A006907
- Coordination sequence for Ni2In, Position Ni2.at n=25A009942
- Convolution of Lucas numbers and primes.at n=12A023625
- a(n) = n^3 + n.at n=19A034262
- Multiplicity of highest weight (or singular) vectors associated with character chi_3 of Monster module.at n=50A034391
- Numbers with multiplicative persistence value 6.at n=1A046515
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=16A049907
- Number of nonzero palindromes < 10^n and containing at least one digit '1'.at n=7A050684
- 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=32A056068
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far).at n=29A060731
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=43A064933
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.at n=35A066697
- Smallest of four consecutive integers divisible by four consecutive primes respectively.at n=42A072555
- Sum of two powers of 19.at n=7A073214
- Positions of A080313 in A014486.at n=14A080312
- a(n) = n^3+n for odd n, (n^3+n)*3/2 for even n: Row sums of A093915.at n=18A093917
- Numbers k such that the k-th semiprime == 11 (mod k).at n=7A106136
- Diagonal sums of number triangle A106522.at n=15A106523
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DDUU's starting at level 2.at n=41A135329
- a(n) integers with digit sum a(n); a(n+1) is the smallest integer > a(n).at n=41A136317