17005
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 4595
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12816
- Möbius Function
- -1
- Radical
- 17005
- 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
- 84
- 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
- Numbers k such that 10*7^k + 1 is prime.at n=19A057437
- Least k such that Sum_{i=1..k} (prime(i) + prime(i+2) - 2*prime(i+1)) = 2n + 1.at n=38A073051
- Partial sums of A006000.at n=18A133252
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=37A153656
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=43A153656
- Numbers k such that 2^k + 29 is prime.at n=28A156982
- Where records occur in A169784.at n=43A175437
- Number of partitions of n into 9 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=18A244245
- Indices of record high values in A036263.at n=11A293155
- Expansion of 1 / ( (1 - 9*x^3) * (1 - x/(1 - 9*x^3)^(1/3)) ).at n=13A373278
- Numbers k such that the k-th maximal run of composite numbers has length different from all prior maximal runs. Sorted positions of first appearances in A176246 (or A046933 shifted).at n=37A373400
- Expansion of 1/sqrt((1-9*x)^3 * (1-x)).at n=4A383946