6050
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 12369
- Proper Divisor Sum (Aliquot Sum)
- 6319
- 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
- 2200
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 67
- 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
- Number of simplices in barycentric subdivision of n-simplex.at n=2A005464
- Coordination sequence for hexagonal close-packing.at n=24A007899
- Coordination sequence for alpha-Nd, Position Nd1.at n=24A009948
- a(0) = 1, a(n) = 42*n^2 + 2 for n>0.at n=12A010023
- Expansion of Product_{k>=1} (1-x^k)^25.at n=4A010830
- Apply partial sum operator 4 times to Fibonacci numbers.at n=12A014166
- Expansion of g.f. 1/((1-x)*(1-4*x)*(1-9*x)*(1-11*x)).at n=3A021964
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=2A025513
- Number of partitions of n that do not contain 10 as a part.at n=31A027344
- a(n) = T(2n+1, n+2), T given by A027948.at n=6A027954
- a(n) = 3^(n-1) - 2^n + 1 (essentially Stirling numbers of second kind).at n=8A028243
- Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.at n=38A028246
- Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.at n=13A028419
- Base-7 palindromes that start with 2.at n=41A043016
- Internal digits of n^2 include digits of n as subsequence.at n=23A046834
- Triangle read by rows, giving T(n,k) = number of k-member minimal ordered covers of a labeled n-set (1 <= k <= n).at n=29A049055
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 2,3,3.at n=14A049875
- Numbers with a sum of digits equal to their greatest prime factor.at n=41A052021
- Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.at n=29A053440
- McKay-Thompson series of class 45b for Monster.at n=48A058686