17699
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19320
- Proper Divisor Sum (Aliquot Sum)
- 1621
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16080
- Möbius Function
- 1
- Radical
- 17699
- 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
- 48
- 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
- Number of strict (-1)st-order maximal independent sets in path graph.at n=19A007382
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RTE = RUB-3 [Si24O48].2R starting with a T1 atom.at n=13A019225
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4, with initial terms 1,-1,1.at n=15A025267
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=35A039848
- a(n) = a(n-1) + rotate( a(n-1), 1 digit left), a(1) = 1.at n=11A051299
- Find the shortest prefix of Pi-3 = .141592653589793238462643383279502.. which is divisible by n and divide by n.at n=7A088143
- Positive integers of the form (18*m^2+1)/11.at n=18A113338
- a(n) = Fibonacci(2*n) - n - 1.at n=9A114185
- Positions of zeros in A165597.at n=3A165598
- Number of permutations in S_{2n} avoiding 123 and 1432 whose matrices are 180-degree symmetric.at n=12A166963
- a(n) = a(n-1) + a(n-2) - floor( a(n-1)/2 ).at n=37A173510
- Number of (n+2) X (2+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=19A257441
- a(n) is the smallest number k such that exactly half of the prime(n+1)-rough numbers in the interval [prime(n)^2 + 1, k] are prime.at n=3A294907
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=17A305177
- a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} gcd(x_1, n)/gcd(x_1, x_2, x_3, n).at n=17A373060
- Triangle read by rows: T(n,d) is the number of free, properly d-dimensional (d,2)-polyominoids of size n, 2 <= d <= n+1.at n=17A387004