6320
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
- 20
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 8560
- 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
- 2496
- Möbius Function
- 0
- Radical
- 790
- Omega Function (Ω)
- 6
- 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
- yes
Recreational
- Happy Number
- yes
- 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
- 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) = (3*n+1)*(3*n+2).at n=26A001504
- a(n) = 2*n*(2*n-1).at n=40A002939
- Column of Kempner tableau.at n=9A005437
- Number of down-up permutations of n+5 starting with n+1.at n=5A006214
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=50A008280
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=50A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=40A008282
- Read across rows of Euler-Bernoulli or Entringer triangle.at n=25A008283
- Triangle of Euler-Bernoulli or Entringer numbers.at n=40A010094
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=30A014088
- Decimal part of n-th root of a(n) starts with digit 2.at n=46A034079
- Product of a prime and the following number.at n=21A036690
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 11 generated by (1,2,...,11).at n=7A036729
- Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).at n=11A036893
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=30A045013
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=27A045186
- Engel expansion of Sum_{k>=0} 1/(6 + k)^k.at n=11A063189
- Triangle in which rows are permutations of the rows of A008282.at n=44A064192
- Rounded value of n*L_n(-1) where L is the Laguerre polynomial.at n=17A070070
- Limit of number of compositions (ordered partitions) of m into distinct parts where largest part is exactly m-n, for m sufficiently large given n.at n=19A072576