17697
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25056
- Proper Divisor Sum (Aliquot Sum)
- 7359
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11072
- Möbius Function
- -1
- Radical
- 17697
- 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
- 97
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.at n=39A025087
- a(n) = Fibonacci(n) AND Fibonacci(n+1).at n=22A051122
- a(n) = floor((4/3)^n).at n=34A064628
- Values of floor((4/3)^n) that are composite.at n=23A070761
- Number of primitive Pythagorean-like triples a^2+b^2=c^2+k for k=-2 with 0<c<=10^n.at n=4A121083
- Positions of zeros in A165597.at n=2A165598
- a(n) = A030068(4n+3).at n=46A169740
- Partial sums of A174928.at n=32A174929
- Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=28A178947
- Triangle read by rows: Pascal's triangle (A007318) times the Fibonacci triangle (A139375).at n=48A201165
- a(n) = 4*n^3 + 5*n^2 + 2*n + 1.at n=16A204674
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..5 array extended with zeros and convolved with 1,1,1.at n=20A222435
- Numbers n such that 2*n*3^n + 1 is prime.at n=30A266694
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 814", based on the 5-celled von Neumann neighborhood.at n=7A273643
- Partial sums of A299255.at n=21A299261