6350
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11904
- Proper Divisor Sum (Aliquot Sum)
- 5554
- 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
- 2520
- Möbius Function
- 0
- Radical
- 1270
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 199
- 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
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=40A005744
- Number of points on surface of hexagonal prism: 12*n^2 + 2 for n > 0 (coordination sequence for W(2)).at n=23A005914
- Number of points on surface of square pyramid: 3*n^2 + 2 (n>0).at n=46A005918
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=38A024305
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=46A036812
- Numbers having four 0's in base 5.at n=35A043352
- Number of numbers below 10^n with nonzero multiplicative digital root 4.at n=4A051824
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=15A070902
- Number of perfect rulers with length n.at n=52A103300
- Sum of three consecutive squares: a(n) = n^2 + (n + 1)^2 + (n + 2)^2.at n=46A120328
- Triangle read by columns: number of n-node (unlabeled) connected graphs with girth k, for n >= 3, k >= 3.at n=47A128042
- Number of n-node (unlabeled) connected graphs with girth 5.at n=9A128242
- Antidiagonal sums of the array A051776.at n=47A141395
- Numbers k with the property that the average digit of k^2 is 2.at n=41A164770
- Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows k = 1,2,..., the sequence represents the number of terms a(i,k-i) in the expansion of the partial derivatives d^k y/du^i dv^{k-i} in terms of partial derivatives of g.at n=39A172004
- Number of symmetry classes of 3 X 3 semimagic squares with distinct positive values and magic sum n.at n=38A173725
- Numbers k such that 6*prime(k) -+ {1,5} are all prime.at n=12A174393
- Inverse permutation to A190134.at n=41A190135
- Number of nXnXn triangular 0..5 arrays with each element equal to at least two neighbors and with new values 0..5 introduced in row major order.at n=5A192901
- Number of nXnXn triangular 0..6 arrays with each element equal to at least two neighbors and with new values 0..6 introduced in row major order.at n=5A192902