6892
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12068
- Proper Divisor Sum (Aliquot Sum)
- 5176
- 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
- 3444
- Möbius Function
- 0
- Radical
- 3446
- 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
- 57
- 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
- Pseudoprimes to base 41.at n=40A020169
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=23A020419
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=27A031804
- Numbers n such that 89*2^n-1 is prime.at n=13A050570
- Number of permutations of length n containing the minimum number of monotone subsequences of length 4.at n=10A079104
- Number of permutations of length n, in which all monotone subsequences of length 4 are descending or all such subsequences are ascending, containing the minimum number of such subsequences subject to that constraint.at n=11A079105
- Number of compositions of n into a square number of parts.at n=16A103198
- a(n) = 4*(n^2 - n + 1).at n=41A112087
- a(n) = n_t(n) where t() = triangular numbers A000217.at n=51A122627
- Even pseudoprimes to base 41.at n=7A130442
- Triangle T(n,r), read by rows, where the r-th column is expansion of A(x)^r, with A(x) = x * (x+1) * (2*x^4+4*x^3-2*x+1) * (x^4+2*x^3-x+1) / (x^2+x-1)^6.at n=31A187055
- Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-2x-2y is in S, and 2 is in S.at n=44A192531
- a(n) = ceiling((n+1/n)^4).at n=8A197903
- Number of (w,x,y,z) with all terms in {1,...,n} and min{|w-x|,|w-y|}=min{|x-y|,|x-z|}.at n=16A212579
- Number of simple involutions of length n.at n=12A244522
- a(n) = n-th pseudoprime to base n.at n=39A247906
- Expansion of Product_{k>=1} (1 + x^(2*k+1))^k.at n=42A263149
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 270", based on the 5-celled von Neumann neighborhood.at n=30A271089
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 926", based on the 5-celled von Neumann neighborhood.at n=23A273778
- Even numbers with a unique representation as the difference of two primes, each of which is a member of a pair of twin primes, and one of which is smaller than the even number under consideration.at n=50A273995