17080
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 44640
- Proper Divisor Sum (Aliquot Sum)
- 27560
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 4270
- Omega Function (Ω)
- 6
- 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
- 66
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- q-factorial numbers for q=-3.at n=5A015015
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CON = CIT-1 H2[B2Si54O112] starting with a T4 atom.at n=13A019100
- Fibonacci sequence beginning 0, 28.at n=15A022362
- Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=24A039752
- Number of character table entries of the symmetric group S_n which are > 0.at n=15A051749
- Closed 3-dimensional ball numbers (version 2): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (1/2,0,0).at n=32A053593
- Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).at n=32A053594
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=15A064675
- Numbers which are sums of two and also sums of three positive cubes.at n=30A085336
- Sums of two distinct prime cubes.at n=34A120398
- Triangle given by T(n,k) = Fibonacci(n+k+1)*binomial(n,k) for 0<=k<=n.at n=42A122070
- Array read by antidiagonals, giving the sizes pi_l(c_l(m,n)) of minimal covers (see reference for precise definition).at n=51A133713
- Row l=5 of array in A133713.at n=6A133715
- Sums of 2 cubes of distinct odd primes.at n=26A137632
- Difference between the cubes and 2*tetrahedral numbers; A000578(n) - 2*A000292(n).at n=30A146298
- Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k).at n=38A171650
- Number of permutations p() of 1..n+4 with centered difference p(i+1)-p(i-1) < 0 exactly 3 times.at n=3A180881
- Array read by antidiagonals: T(n,k)=number of permutations p() of 1..n+k with centered difference p(i+1)-p(i-1) < 0 exactly k-1 times.at n=24A180887
- A binomial transform of Fibonacci numbers.at n=38A185384
- Number of permutations p of 1,2,...,n satisfying |p(i+4)-p(i)|<>5 and |p(j+5)-p(j)|<>4 for all i=1..n-4, j=1..n-5.at n=8A189570