6874
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
- 8
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 4934
- 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
- 2940
- Möbius Function
- -1
- Radical
- 6874
- 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
- 150
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=26A020401
- Number of partitions of n into parts not of the form 15k, 15k+7 or 15k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=34A035961
- Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5).at n=31A039841
- Numbers that are equal to the sum of their anti-divisors.at n=6A073930
- Integer averages of two successive perfect powers (pp(n) + pp(n+1))/2.at n=20A075454
- Distinct-digit averages of two successive perfect powers (pp(n) + pp(n+1))/2.at n=14A075456
- Convolution of sigma(n) with phi(n).at n=34A086733
- Number of (n,4) Freiman-Wyner sequences.at n=9A097926
- G.f. satisfies: A(x) = 1/(1 + x*A(x^6)) and also the continued fraction: 1+x*A(x^7) = [1;1/x,1/x^6,1/x^36,1/x^216,...,1/x^(6^(n-1)),...].at n=56A101916
- G.f.: A(x) = x/(1-x) o x/(1-x^2) o x/(1-x^4) o x/(1-x^8) o..., composition of functions x/(1 - x^{2^n}) for n=0,1,2,3,...at n=16A136752
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 1), (0, 1, 0), (1, -1, -1)}.at n=11A148009
- a(n) = 686*n + 14.at n=9A157366
- a(n) = 625*n - 1.at n=10A158374
- Harmonic anti-divisor numbers.at n=10A192272
- a(n) = 11*5^n-1.at n=4A198770
- Anti-multiply-perfect numbers. Numbers n for which sigma*(n)/n is an integer, where sigma*(n) is the sum of the anti-divisors of n.at n=11A214842
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=18A219768
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (2,k)-anti-perfect numbers.at n=22A229860
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (3,k)-anti-perfect numbers.at n=14A229861
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (4,k)-anti-perfect numbers.at n=20A229862