8799
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 4641
- 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
- 5016
- Möbius Function
- -1
- Radical
- 8799
- 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
- 101
- 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
- Partial sums of A001037, omitting A001037(1).at n=15A001036
- Number of partitions of n into 6 unordered relatively prime parts.at n=50A023026
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=32A025193
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 5.at n=11A038636
- Numbers k such that 291*2^k + 1 is prime.at n=27A053362
- a(n) = smallest multiple of 7 with a digit sum = n.at n=31A077493
- Numbers k such that k*k! - 1 is prime.at n=22A090704
- Expansion of 1/(1-2x^2-3x^3-x^4).at n=15A124370
- a(n) = n^3 - n^2 - n.at n=21A152015
- a(n) = 6^n + 4^n - 1.at n=5A155617
- a(n) = 400*n - 1.at n=21A158317
- a(n) = 22*n^2 - 1.at n=19A158540
- Numbers with rounded up arithmetic mean of digits = 9.at n=19A178369
- n*a(n) provides the Moebius transform of signed central binomial coefficients.at n=20A178749
- Number of n X 6 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=3A207066
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=39A207068
- Number of 4Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=5A207071
- G.f. satisfies: A(x) = 1 + x*A(x)^3 / (A(x) - x*A'(x)).at n=6A245118
- Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8*n)-1)/2)<=k<=n, read by rows.at n=20A316292
- Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.at n=28A316293