17795
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21360
- Proper Divisor Sum (Aliquot Sum)
- 3565
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14232
- Möbius Function
- 1
- Radical
- 17795
- 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
- 35
- 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) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.at n=40A059605
- Structured truncated octahedral numbers.at n=14A100155
- Iccanobirt prime indices (11 of 15): Indices of prime numbers in A102121.at n=16A102141
- Number of nondecreasing integer sequences of length 19 with sum zero and sum of absolute values 2n.at n=13A158153
- Number of nonempty subsets of {1, 2, ..., n} with <= 4 pairwise coprime elements.at n=40A187265
- Numbers k such that A = k+DigitProd(k) is divisible by the largest power of 10 <= A.at n=23A242948
- Number of (n+2)X(2+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=1A251847
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=4A251852
- a(n) = ((n+2)/2)*Sum_{k=0..n/2} (Sum_{i=0..n-2*k} (binomial(k+1,n-2*k-i)*binomial(k+i,k))*F(k+1)/(k+1)), where F(k) is Fibonacci numbers.at n=13A270737
- Number of integer compositions of n whose parts have weakly decreasing numbers of prime factors (with multiplicity).at n=24A358335
- Expansion of Sum_{k>0} x^(2*k)/(1 - k*x^k)^2.at n=23A363641