6342
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14592
- Proper Divisor Sum (Aliquot Sum)
- 8250
- 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
- 1800
- Möbius Function
- 1
- Radical
- 6342
- 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
- 80
- 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
- Reverse digits of number of partitions of n.at n=26A004089
- Sum of distinct prime divisors of p(n)*p(n-1) + 1.at n=44A023529
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) < cn(3,5).at n=73A036874
- Numbers with exactly 4 distinct palindromic prime factors.at n=12A046402
- Numbers n such that n and its reversal are both multiples of 14.at n=30A062904
- Non-palindromic number and its reversal are both multiples of 14.at n=20A062913
- a(3) = 2, a(4) = 3; for n > 4, a(n) = {a(n-2)}+{a(n-1)}, where {a} means largest prime <= a.at n=18A065435
- n - 5^k is a prime for all k > 0 and n > 5^k.at n=52A067529
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 5), divided by 5.at n=13A073362
- Number of maximal independent generating sets for S_n.at n=5A078103
- Number of iterations of the sine function to be less than 1/n with an initial argument of Pi/2 radians.at n=45A092906
- Antidiagonal sums of square array A093541, in which column (k+1) equals the self-convolution of row k.at n=8A093542
- "666" in bases 7 and higher rewritten in base 10.at n=25A121205
- Numbers k for which 14*k+1, 14*k+5, 14*k+11 and 14*k+13 are primes.at n=23A123987
- Triangular sequence of coefficients from a polynomial recursion: p(x,n)=-2 (-(n - 1) + x)*p(x, n - 1) + (-(n + 1) + (n + 2)* x - x^2)p(x, n - 2).at n=22A137663
- G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^2)^6.at n=6A137968
- 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, 1, 0), (0, 0, -1), (1, 0, 0), (1, 0, 1)}.at n=7A150348
- Numbers k such that (10^k - 1)*140/99 + 1 is prime.at n=5A153331
- Expansion of (A(x)-1)/(x*A(x)), A(x) the g.f. of A004211.at n=6A171151
- a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2) - floor(a(n-5)/2); initial terms are 1, 1, 2, 3, 4.at n=48A171997