17760
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
- 48
- Divisor Sum
- 57456
- Proper Divisor Sum (Aliquot Sum)
- 39696
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 1110
- Omega Function (Ω)
- 8
- 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
- 35
- 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
- Number of normalized Latin squares of order n containing no 2 X 2 Latin subsquare.at n=6A000611
- Number of primitive (aperiodic) step shifted (decimated) sequences using a maximum of four different symbols.at n=7A056383
- Numbers k such that sigma (x) = k has exactly 12 solutions.at n=20A060676
- Numbers k such that phi(k) = 2*tau(k)^2.at n=23A068564
- First differences of A069474, successive differences of (n+1)^6-n^6.at n=5A069475
- Q(3,n), where Q(m,k) is defined in A127080 and A127137.at n=11A127145
- Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n-n-th digit of "e"]. If k<0 or k=0, then a(k)=0.at n=35A133392
- a(n) = prime(prime(n*n) - n*n) - n*n where prime(n) is the n-th prime.at n=18A141127
- Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d.at n=23A141586
- a(n) = (n^3 + 18*n^2 + 17*n + 6)/6.at n=42A143058
- E.g.f. satisfies: A'(x) = 1/(1 - x*A(x)) with A(0)=1.at n=7A144010
- Numbers n = concat(a,b) such that phi(n) = phi(a) * phi(b), where phi = A000010.at n=28A147619
- Number of binary strings of length n with equal numbers of 01110 and 10001 substrings.at n=15A164264
- Number of permutations of length n which avoid the patterns 4312 and 2143.at n=9A165529
- a(n) = Least i in range [A165598(n),A165598(n+1)] for which abs(A165597(i)) gets the maximum value in that range.at n=17A165599
- Number of permutations of 1..n with no adjacent pair summing to n+2.at n=8A173842
- Number of permutations of 1..n with no adjacent pair summing to n+3.at n=8A173843
- Numbers of the form p^5*q*r*s where p, q, r, and s are distinct primes.at n=17A179704
- Number of permutations of {1,2,...,2n} , say x(1),x(2), ... , x(2n) , such that x(i) + x(i+1) is not equal to 2n-1 for all i, 1<=i<=2n-1.at n=3A181142
- Number of nondecreasing strings of numbers x(i=1..6) in -n..n with sum x(i)^3 equal to 0.at n=38A188280