17772
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 41496
- Proper Divisor Sum (Aliquot Sum)
- 23724
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5920
- Möbius Function
- 0
- Radical
- 8886
- Omega Function (Ω)
- 4
- 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
- 97
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions satisfying 0 < cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(4,5) + cn(2,5) + cn(3,5).at n=36A039901
- Numerators of continued fraction convergents to sqrt(160).at n=8A041294
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide.at n=38A058367
- Expansion of x*(2-4*x^2-x^3)/((1-x)^2*(1-x-x^2)).at n=20A133931
- a(n+2) = a(n+1)*(n mod 3 + 1) + (n mod 2 + 1), a(1) = 11.at n=13A136433
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=8A149469
- a(n) = floor((2^n)/(3*n - 1)).at n=19A191629
- Number of (n+2) X 9 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=18A204753
- a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=39A215525
- Number of (n+2) X (6+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=6A252112
- Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=5A252113
- Indices of primes in the 10th-order Fibonacci number sequence, A127194.at n=33A257073
- a(n) = (n+1)!*Sum_{k=0..(n-1)/2}(k!*stirling1(n-k,k+1)*(-1)^(n+1)/(n-k)!/(k+1)!).at n=7A270707
- Number of 6 X n 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=15A301795
- Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=13A333013