6236
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 4684
- 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
- 3116
- Möbius Function
- 0
- Radical
- 3118
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 62
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 64.at n=31A020403
- Numbers having three 8's in base 9.at n=12A043487
- Numbers k such that k^18 == 1 (mod 19^3).at n=15A056089
- a(n) = smallest k such that the digit sum of 8k is n.at n=37A077495
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={2,4}.at n=16A079959
- Numbers n such that (sigma(n-2)+sigma(n+2))/2 = sigma(n).at n=22A099631
- Numbers n such that 8*10^n + 6*R_n - 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=19A103087
- The first 10 digits of the fifth root of n contain the digits 0-9.at n=3A119520
- Concatenation of first two digits and last two digits of n-th even superperfect number A061652(n).at n=43A138869
- Numbers n such that Mordell's equation y^2 = x^3 - n has exactly 12 integral solutions.at n=12A179170
- L.g.f: A(x) = Sum_{n>=1} a(n)*x^n/n = Sum_{n>=1} E( a(n)*x )^n*x^n/n where E(x) = exp(A(x)) is the g.f. of A180720.at n=4A180721
- T(n,k)=Number of nXk binary matrices M with rows in strictly increasing order and rows of M*Mtranspose (mod 2) in strictly increasing order.at n=30A181266
- Number of n X (n+3) binary matrices M with rows in strictly increasing order and rows of M*Mtranspose (mod 2) in strictly increasing order.at n=2A181269
- Number of 3 X n binary matrices M with rows in strictly increasing order and rows of M*Mtranspose (mod 2) in strictly increasing order.at n=5A181271
- The location of records in A210700.at n=22A210701
- Number of (w,x,y,z) with all terms in {0,...,n} and at least one of these conditions holds: w<R, x<R, y<R, z>R, where R=max{w,x,y,z}-min{w,x,y,z}.at n=8A212752
- Sum of numerators of Farey Sequence of order n.at n=38A213544
- Integers k such that (k^2 + (k+1)^2) has no square proper substring.at n=51A238903
- Number of compositions of n into distinct parts with exactly nine descents.at n=14A241728
- G.f. = b(2)*b(6)*b(10)/(x^15+x^14+x^13+x^12+x^11-2*x^5-x^4-x^3-x^2-x+1), where b(k) = (1-x^k)/(1-x).at n=11A266373