6844
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 5756
- 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
- 3248
- Möbius Function
- 0
- Radical
- 3422
- 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
- a(n) = floor(n*(n-1)*(n-2)/30).at n=60A011912
- a(n) = 4*n*(2*n + 1).at n=29A033586
- Multiplicity of highest weight (or singular) vectors associated with character chi_70 of Monster module.at n=45A034458
- Sums of 6 distinct powers of 3.at n=29A038468
- Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).at n=19A054578
- Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.at n=16A056764
- a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.at n=39A066809
- Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts.at n=21A093694
- Array read by antidiagonals: T(n,k) = variant of Knuth's Fibonacci (or circle) product of n and k (A101330).at n=41A101385
- Array read by antidiagonals: T(n,k) = variant of Knuth's Fibonacci (or circle) product of n and k (A101330).at n=39A101385
- Numbers n such that phi(n) = phi(n + phi(n)).at n=38A108569
- Number of 6-dimensional partitions of n up to conjugacy.at n=14A119341
- a(n) = 5*n^2 - 1.at n=36A134538
- Number of maximal directed trails in the labeled n-ladder graph P_2 X P_n.at n=30A135443
- Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 8.at n=10A136931
- The second left hand column of triangle A167552.at n=28A167554
- Triangle, read by rows, where row n equals the coefficients of y^k in R_{n-1}(y+y^2) for k=2..n, where R_n(y) is the n-th row polynomial in y for n>=2 with R_2(y)=y^2.at n=32A187115
- Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-2x-2y is in S, and 2 is in S.at n=43A192531
- a(n) = 4*(5*n^2 - 5*n + 1).at n=18A193448
- Number of partitions of n plus number of divisors of n.at n=30A195364