6853
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 1787
- 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
- 5280
- Möbius Function
- -1
- Radical
- 6853
- 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
- 31
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/((1-x)^4*(1+x)).at n=41A002623
- a(n) = n^3 - floor( n/3 ).at n=19A002901
- Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=4A006601
- E.g.f. sinh(log(1+x))/exp(x). Unsigned sequence gives degrees of (finite by nilpotent) representations of Braid groups.at n=7A009578
- a(n) = n*(n+1)*(4*n+5)/6.at n=21A016061
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ATO = AlPO4-31 [ Al18P18O72 ].at n=5A018984
- Pseudoprimes to base 34.at n=46A020162
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 9.at n=15A022323
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=41A023856
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=40A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).at n=40A024853
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 0, s(2n) = n. Also a(n) = T(2n,n), where T is the array in A026300.at n=6A026302
- a(n) = T(n,[ n/2 ]), where T is the array in A026300.at n=12A026307
- Dirichlet convolution of b_n=2^(n-1) with c_n=3^(n-1).at n=8A034735
- Sets of 4 consecutive numbers with equal number of divisors.at n=16A039665
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=10A066509
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and divisible by phi(k), that is A065395(k)/A000010(k) is a nonzero integer.at n=35A092587
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis from above (i.e., d steps hitting the x-axis).at n=45A109195
- 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, 1, 1), (1, 0, 0), (1, 1, -1), (1, 1, 0)}.at n=7A150380
- a(n), a(n+1), a(n+2), for n=5,8,11,... are respectively the numbers of representations of the integers 2^k-2, 2^k, 2^k+2, where k=(n+4)/3, by unordered sums of two odd primes not belonging to A158847.at n=44A158855