6322
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9900
- Proper Divisor Sum (Aliquot Sum)
- 3578
- 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
- 3024
- Möbius Function
- -1
- Radical
- 6322
- Omega Function (Ω)
- 3
- 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
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 e.g.f. exp(x*exp(x)).at n=7A000248
- Pseudoprimes to base 45.at n=35A020173
- Numbers k such that the continued fraction for sqrt(k) has period 27.at n=25A020366
- a(n) = n*(15*n + 1)/2.at n=29A022273
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 17.at n=1A031605
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=22A045183
- Integers whose set of prime factors (taken with multiplicity) uses each digit exactly once (i.e., is pandigital) in some base b > 1. Numbers are expressed in base 10.at n=31A058760
- Centered heptagonal numbers.at n=42A069099
- Bisection (even part) of Chebyshev sequence with Diophantine property.at n=4A077246
- Combined Diophantine Chebyshev sequences A077246 and A077244.at n=8A077248
- Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals.at n=35A098697
- First differences of A047780.at n=7A100790
- Round(1000*x), where x is the solution to x = 3^(n-x).at n=8A103537
- The cube-root of the g.f. of A112280, which is congruent modulo 9 to the cube of q-series (q;q)_oo.at n=7A112281
- Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=28A116071
- Numbers k such that k*(k+1) gives the concatenation of two numbers m and m+9.at n=3A116348
- Number of up steps starting at an odd level in all nondecreasing Dyck paths of semilength n. A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.at n=8A121525
- The first 8 values are predefined, the remaining set to a(n) = 48*prime(n)+n+2.at n=31A129025
- Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.at n=35A143397
- Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.at n=29A143398