6354
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13806
- Proper Divisor Sum (Aliquot Sum)
- 7452
- 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
- 2112
- Möbius Function
- 0
- Radical
- 2118
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Vertex diagrams of order 2n.at n=5A005416
- Number of unrooted quartic trees with n (unlabeled) nodes and possessing a centroid; number of n-carbon alkanes C(n)H(2n +2) with a centroid ignoring stereoisomers.at n=15A010372
- Fibonacci sequence beginning 3, 15.at n=14A022381
- a(n) = [ 3rd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=11A025194
- Numbers k such that 243*2^k+1 is prime.at n=20A032498
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=15A045216
- Numbers n such that n through n+4 are divisible by the same number of distinct primes.at n=45A045933
- Numbers n such that n | (sigma_5(n) - phi(n)^5).at n=17A055699
- Eighth column (k=7) of sextinomial array A063260.at n=7A063262
- Number of polyiamonds with n cells that tile the plane.at n=13A071332
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2*p-1, where a(i,p) satisfies Sum_{i=1..n} C(i+1,2)^p = 3 * C(n+2,3) * Sum_{i=1..2*p-1} a(i,p) * C(n-1,i-1)/(i+2).at n=19A087127
- For each pair of twin primes (p,p+2) take the absolute value of the difference between p and p with digits reversed.at n=49A088489
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=18A104809
- Numbers k such that k + prime(k) gives a triangular number.at n=28A115882
- a(n) is the smallest integer k such that the n-th (backward) difference of the partition sequence A000041 is positive from k onwards.at n=21A155861
- Triangle of numbers C^(5)(n,k) of combinations with repetitions from n different elements over k for each of them not more than 5 appearances allowed.at n=52A213744
- Number of n X 2 0..7 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 8, and upper left element zero.at n=9A230509
- Number of length 1+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=17A248462
- Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo n+1.at n=7A269679
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 190", based on the 5-celled von Neumann neighborhood.at n=24A270683