8919
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12896
- Proper Divisor Sum (Aliquot Sum)
- 3977
- 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
- 5940
- Möbius Function
- 0
- Radical
- 2973
- 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
- 47
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).at n=14A067129
- Trajectory of 775 under the Reverse and Add! operation carried out in base 2, written in base 10.at n=4A077077
- Number of consecutive prime runs of 9 primes congruent to 1 mod 4 below 10^n.at n=8A092660
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the last block is the singleton {k}, 1<=k<=n; the blocks are ordered with increasing least elements.at n=59A108458
- a(2*n+1) = 9*a(n), a(2*n+2) = 10*a(n) + a(n-1).at n=21A116555
- a(2*n+1) = 9*a(n), a(2*n+2) = 10*a(n) + a(n-1).at n=25A116555
- Numbers k which can be split into two numbers x and y such that x^3 + y^2 is a multiple of k.at n=26A162451
- a(n) = 6*a(n-1)-8*a(n-2)-9 for n > 3; a(0)=775, a(1)=8919, a(2)=49581, a(3)=197469.at n=1A177843
- a(n) = 6*a(n-1)-8*a(n-2)-3 for n > 2; a(0)=775, a(1)=8919, a(2)=34223.at n=1A177845
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=15A208181
- Cardinality of the Weyl alternation set corresponding to the zero-weight in the adjoint representation of the Lie algebra sp(2n).at n=13A232165
- a(n) = floor(n^2 * log(n)).at n=47A235707
- Number of meta-Sylvester classes of 3-multiparking functions of length n.at n=5A243697
- G.f. satisfies: A(x) = 1 + x*A(x) + x^2*A(x)^2 + 3*x^3*A(x)*A'(x) + x^4*A(x)*A''(x).at n=7A245313
- The growth series for the affine Weyl group F_4.at n=26A266784
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 350", based on the 5-celled von Neumann neighborhood.at n=28A271303
- Number of n X 3 0..2 arrays with no three equal values forming an isosceles triangle, and new values introduced in 0..2 order.at n=43A274067
- Smallest positive integer which can be represented as the sum of distinct positive cubes in exactly n ways, or 0 if no such integer exists.at n=44A275154
- Numbers n such that prime(n) contains a substring of all the prime digits in order, i.e., "2357".at n=1A295708
- a(0) = 0, a(1) = 1; a(2*n) = 9*a(n), a(2*n+1) = a(n) + a(n+1).at n=50A342615