17466
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 18822
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- 1
- Radical
- 17466
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 141
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(1) = 6, a(2) = 24; for n>=3, a(n) = 4a(n-1) - a(n-2).at n=7A001352
- Number of increasing sequences of addition chain type with maximal element n.at n=17A008928
- Even 9-gonal (or enneagonal) numbers.at n=35A028992
- a(n) = floor(n^3 / Pi).at n=38A032633
- a(n) = (2*n+1)*(7*n+1).at n=35A033572
- Numerators of continued fraction convergents to sqrt(48).at n=6A041082
- Enneagonal numbers whose sum of digits is also enneagonal.at n=10A117051
- Even pseudoprimes to base 37.at n=20A130441
- Composites c where at least one base b with 1 < b < c exists such that b^(c-1) == 1 (mod c^2), i.e., composites c that are base-b 'Wieferich pseudoprimes' for at least one b between 1 and c.at n=39A267288
- Exponents of x in the numerator of cluster variables of a rank 2 cluster algebra.at n=14A272073
- Numbers n such that A002088(n) < 3n^2/Pi^2.at n=29A285022
- Expansion of Product_{k>=1} ((1 + x^(2*k))/(1 - x^(2*k-1)))^k.at n=23A295831
- Numbers k whose binary expansion contains 2 adjacent 1's and A391571(k) = k.at n=34A391581