17054
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 25584
- Proper Divisor Sum (Aliquot Sum)
- 8530
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8526
- Möbius Function
- 1
- Radical
- 17054
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 128
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that 213*2^k+1 is prime.at n=14A032483
- a(1) = 1; a(n+1) = sum of terms in continued fraction for sum{k=1 to n}[a(n+1-k)/a(k)].at n=14A057873
- Numbers n such that sigma(reversal(n)) = reversal(sigma(n)). Ignore leading 0's.at n=16A069514
- Sum of all parts of the n-th subshell of the head of the last section of the set of partitions of any even integer >= 2n.at n=15A182994
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, five or six distinct values for every i,j,k<=n.at n=5A211732
- First appearance of n in A016014, or 0 if n never occurs.at n=38A239800
- Number of partitions p of n such that 2*(number of even numbers in p) >= (number of odd numbers in p).at n=37A241654
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=27A274234
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=6A305345
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=5A305346
- Number of integer partitions of n such that every pair of distinct parts has a different product.at n=37A325856
- Records in A009101.at n=12A354710