6492
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15176
- Proper Divisor Sum (Aliquot Sum)
- 8684
- 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
- 2160
- Möbius Function
- 0
- Radical
- 3246
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 137
- 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
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=35A052477
- Numbers n such that n | p(n)*q(n), where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).at n=42A060744
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=31A063052
- a(1)=5; a(n)=floor((29+sum(a(1) to a(n-1)))/5).at n=39A120174
- Product of the first n 3-almost primes, divided by product of the first n primes, rounded down.at n=8A122032
- a(n) = 216*n + 12.at n=29A154519
- Partial sums of A023200.at n=27A172112
- Monotonic ordering of set S generated by these rules: if x and y are in S then 2xy-x-y is in S, and 3 is in S.at n=11A192525
- G.f.: A(x) = x + x*ITERATE^2(x + 2*x*ITERATE^2(x + 3*x*ITERATE^2(x + 4*x*ITERATE^2(x + ...)))), where ITERATE^2(F(x)) = F(F(x)), and the nested iterations continue indefinitely.at n=5A195193
- Triangle arising in the computation of hypersigma, definition 2 (A191161).at n=26A202687
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=21A209984
- Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=24A212683
- Numbers n such that n^2 + 1 and (n+1)^2 + 1 are divisible by a square.at n=29A217798
- Row sums of triangle A027420.at n=35A241944
- Numbers k such that Bernoulli number B_k has denominator 2730.at n=20A249134
- G.f. A(x) satisfies: A(x)^2 = A( x^2*(1+x)/(1-x) ), with A(0) = 0.at n=15A259117
- Number of ways to choose three distinct points from a 3 X n grid so that they form an isosceles triangle.at n=47A271912
- Numbers k such that (2^k + 5) / 3 is prime.at n=16A273009
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 0, a(2) = 2, a(3) = 1.at n=20A295689
- Numbers m such that there are precisely 18 groups of order m.at n=43A298909