17658
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 39930
- Proper Divisor Sum (Aliquot Sum)
- 22272
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5832
- Möbius Function
- 0
- Radical
- 654
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 172
- 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
- Expansion of a modular function for Gamma_0(6).at n=14A002508
- Coordination sequence for MgCu2, Cu position.at n=33A009930
- Averages of twin primes of the form : i^2+j^2, as sum of two squares.at n=31A143793
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 2 ones in any 4 X 4 X 4 subtriangle.at n=19A153916
- Averages of twin prime pairs which are a sum of averages of two consecutive twin prime pairs.at n=31A160916
- The sum of the elements within a jump in a Sieve of Eratosthenes table.at n=28A179545
- Number of (n+1)X(2+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=4A235542
- Number of (n+1)X(5+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=1A235545
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=16A235548
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=19A235548
- Number of nX4 arrays of permutations of 4 copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.at n=3A267900
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.at n=24A267901
- Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.at n=3A267904
- Smallest k such that (k+i)*prime(n)# - 1 is prime for i = 0, 1, 2, 3, 4 with prime(n)# = A002110(n) the n-th primorial, n>1.at n=17A277691
- Expansion of g.f. A(x) satisfying A( x*A(x)^2 + x*A(x)^3 ) = A(x)^3.at n=12A371709