17670
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 46080
- Proper Divisor Sum (Aliquot Sum)
- 28410
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- -1
- Radical
- 17670
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Odd
- no
Appears in sequences
- Magnetization for hexagonal lattice.at n=14A007207
- Denominators of continued fraction convergents to sqrt(552).at n=5A042057
- Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=21A057002
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=41A064009
- Product of the anti-divisors of n.at n=44A091507
- Denominators of n divided by the product of the anti-divisors of n.at n=44A093396
- Lcm[{ad(n)}], i.e. the least common multiple of the anti-divisors of n.at n=44A096357
- Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=29A114168
- a(n) = 49*n^2 - n.at n=18A157923
- a(n) = 361*n^2 - 19.at n=6A158595
- a(n) = 19*n*(n+1).at n=30A173309
- Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences.at n=32A200274
- Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y>3z.at n=20A212514
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,-2,1.at n=17A222151
- Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.at n=33A224611
- Number of length n+3 0..7 arrays with no four elements in a row with pattern aabb (with a!=b) and new values 0..7 introduced in 0..7 order.at n=5A242583
- Numbers n such that n^3+prime(n) and n^3-prime(n) are prime.at n=41A257788
- Numbers n such that sigma(n^3) is the sum of two positive cubes.at n=37A281364
- Partitions into parts with frequency less than or equal to their place in the list of summands.at n=50A295261
- a(n) = n*(2*n - 3 - (-1)^n)*(5*n - 2 + (-1)^n)/16.at n=30A308025