6828
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
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15960
- Proper Divisor Sum (Aliquot Sum)
- 9132
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2272
- Möbius Function
- 0
- Radical
- 3414
- Omega Function (Ω)
- 4
- 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
- no
- 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
- Theta series of lattice Kappa_8.at n=8A015235
- Number of n-move knight paths on 8 X 8 board from given corner to same corner.at n=8A025600
- Numbers with exactly five distinct base-9 digits.at n=32A031986
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5).at n=31A039904
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=37A052477
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=19A055755
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,1).at n=10A074084
- Interprimes which are of the form s*prime, s=12.at n=20A075287
- Sum of n-th antidiagonal of array in A081998.at n=14A082001
- Partial sums of A034953(n).at n=15A085739
- Indices k where A057176(k) = 2.at n=14A086809
- a(n) = n for n <= 2; for n > 2, a(n) = 2a(n-1) - a(n - floor(1/2 + sqrt(2(n-1)))).at n=17A096824
- Sum of the first n n-digit primes less n*10^(n-1).at n=19A114053
- a(0)=2, a(1)=8, a(n) = a(n-1) + 2*a(n-2).at n=11A115102
- Numbers k such that A003313(k) = A003313(3*k).at n=42A116459
- Number of partitions of n in which each part, with the possible exception of the largest, occurs at least three times.at n=49A116932
- a(n) = Sum_{k=1..phi(n)-1} t(n,k)*t(n,k+1), where t(n,k) is the k-th positive integer which is coprime to n and phi(n) is the number of positive integers which are <= n and are coprime to n.at n=32A119584
- Triangle read by rows: T(n,k) is the number of binary trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).at n=39A127532
- a(n) = 4*a(n-1) - 4 for n>0, a(0)=3.at n=6A135583
- Values of z in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z arranged in order of increasing x.at n=12A138669