8851
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
- 4
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 221
- 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
- 8632
- Möbius Function
- 1
- Radical
- 8851
- 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
- 47
- Smith Number
- yes
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 29 ones.at n=0A031797
- Numbers whose set of base-14 digits is {2,3}.at n=27A032814
- Number of nonisomorphic systems of catafusenes in an example in Cyvin et al. (1994) with two appendages to the core indexed by the total number of hexagons in the appendages.at n=8A045903
- Number of partitions of 5n with equal number of parts congruent to each of 0, 1, 2, 3 and 4 (mod 5).at n=15A046776
- Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=18A090167
- Numbers n such that p(5n) is prime, where p(n) is the number of partitions of n.at n=25A114166
- Four-column table read by rows: number of nonisomorphic systems of catafusenes in an example (see Cyvin et al. (1994) for precise definition).at n=29A121178
- Triangle interpolating the binomial transform of the swinging factorial (A163865) with the swinging factorial (A056040).at n=46A163840
- Number of lower triangles of an n X n 0..4 array with each element equal to the number of its horizontal and vertical neighbors unequal to itself.at n=13A195952
- Number of 0..n arrays x(0..3) of 4 elements with zero 3rd differences.at n=29A200155
- The least number with exactly n ones in the continued fraction of its square root.at n=29A206578
- Number of 4 X n 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=8A223840
- Number of partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is a part.at n=40A241442
- Number of numbers between min(p) and max(p) that are not parts of the partition p, summed over all partitions of n.at n=24A265252
- a(0) = a(1) = 1, and a(n) = a(n-1) + a( (a(n-1)-1) mod n ) for n>=2.at n=30A268176
- Number of iterations of A268395 needed to reach zero from 2^n: a(n) = A268708(2^n).at n=17A268709
- Number of iterations of A268395 needed to reach zero from 2^n + 1: a(n) = A268708(2^n + 1).at n=17A268710
- Compound filter (summands of A004001 & summands of A005185): a(n) = P(A286541(n), A286559(n)), where P(n,k) is sequence A000027 used as a pairing function, with a(1) = a(2) = 0.at n=21A286560
- Where the zeros in A123066 occur.at n=20A321962
- Numbers k such that k![4] - 128 is prime, where k![4] = A007662(k) = quadruple factorial.at n=33A329176