8553
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11408
- Proper Divisor Sum (Aliquot Sum)
- 2855
- 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
- 5700
- Möbius Function
- 1
- Radical
- 8553
- Omega Function (Ω)
- 2
- 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
- 52
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1.at n=21A008609
- Denominators of continued fraction convergents to sqrt(138).at n=8A041253
- Numbers having four 3's in base 6.at n=25A043384
- Number of permutations of length n which avoid the patterns 1234, 3421, 4312.at n=21A116756
- Least number k>1 such that k+10^n is a symmetric prime with symmetric digits (i.e. such that k+10^n is in A007500).at n=56A122490
- Expansion of limit b(n)/x^n where b(n) = b(n-1)^2 + b(n-1)*x, b(1) = x^2.at n=19A124571
- G.f.: A(x) = 1 + x*(A_2)^3; A_2 = 1 + x^2*(A_3)^3; A_3 = 1 + x^3*(A_4)^3; ... A_n = 1 + x^n*(A_{n+1})^3 for n>=1 with A_1 = A(x).at n=25A132330
- 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, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=8A149020
- a(n) = a(n-1) + a(n-2) - a(n-4) starting a(0)=0, a(1)=1, a(2)=a(3)=3.at n=29A168637
- Maximum number of rational points on a smooth absolutely irreducible projective curve of genus 2 over the field F_2^n.at n=12A169873
- Number of lattice paths from (0,0) to (n,n) using steps S={(k,0),(0,k)|0<k<=4} which never go above the line y=x.at n=6A175891
- Number of 7's in the last section of the set of partitions of n.at n=46A206557
- Expansion of Product_{k>=1} 1 / (1 + k*x^k)^k.at n=17A266971
- Number of length-n 0..2 arrays with no repeated value differing from the previous repeated value by plus or minus one modulo 2+1.at n=8A269684
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by plus or minus one modulo k+1.at n=53A269690
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 537", based on the 5-celled von Neumann neighborhood.at n=20A272792
- Indices of primes followed by a gap (distance to next larger prime) of 40.at n=22A320718
- Maximum position to start a search within the decimal digits of Pi in order to find all numeric strings with length n.at n=2A332262
- Number of strict integer partitions of 2n not containing n.at n=29A365828
- a(n) = Sum_{d|n} (-1)^(n/d-1) * binomial(d+2,3).at n=37A366813