6422
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10980
- Proper Divisor Sum (Aliquot Sum)
- 4558
- 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
- 2808
- Möbius Function
- 0
- Radical
- 494
- 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
- 124
- 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) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Lucas numbers).at n=16A024368
- n written in fractional base 8/6.at n=26A024648
- Erroneous version of A024368.at n=15A025068
- Number of distinct products i*j*k with 1 <= i < j < k <= n.at n=48A027430
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.at n=41A050770
- Numbers k such that k | sigma_6(k).at n=31A055710
- a(n) = Sum_{k=1..n} phi(k)^2.at n=35A057434
- 3-wave sequence beginning with 2's.at n=21A060827
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=19A072607
- Numbers m such that the numerator of Sum_{i=1..m} prime(i)/prime(i+1) is prime.at n=11A090808
- a(n) = 2^n - A143658(n).at n=14A101836
- Slowest increasing and self-describing sequence: first 2 digits are prime digits, followed by 3 composite digits, then 4 prime digits, then 6 composite digits, then 8 prime, then 2 composite, then 2 prime, etc.at n=30A105808
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=25A109182
- Number of ways to place zero or more nonadjacent 1,1 2,0 2,1 3,2 4,2 5,3 5,4 6,3 polyhexes in any orientation on a planar n X n X n triangular grid.at n=7A155420
- Total sum of the smallest part of every partition of every shell of n.at n=22A196039
- Fibonacci sequence beginning 13, 9.at n=14A206609
- Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 n X 4 array.at n=4A218893
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array.at n=32A218897
- Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 5Xn array.at n=3A218901
- Expansion of 2*x^4*(1-2*x+x^4)/((1+x)*(1-2*x)^2*(1-x-x^2)).at n=14A219752