17289
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
- 12
- Divisor Sum
- 26676
- Proper Divisor Sum (Aliquot Sum)
- 9387
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- 0
- Radical
- 5763
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of log(1+x)*exp(sin(x)).at n=9A009417
- a(n) is the decimal concatenation of n and n^2.at n=16A053061
- a(n) = (4*n^2 + 2*n - 3)*(2*n - 1)*n/3.at n=9A058581
- a(0) = 1; a(n) = half of the a(n-1)-th even nontotient number.at n=10A071598
- Numbers k such that 10^999 + k is a (titanic) prime.at n=10A074282
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=26A095182
- a(n) is the smallest positive number such that a(n)*n is an anagram of a(n)*9.at n=34A175698
- Ascending sequence of numbers such that the sum of any two distinct elements (even + odd) is a prime number.at n=35A180743
- Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements.at n=2A203829
- Number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements.at n=1A203830
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=7A203835
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=8A203835
- a(n) = n*(n+1)*(7*n-6)/2.at n=17A256718
- Concatenation of prime(n) and its square.at n=6A271422
- The icosagen sequence : a(n) = A018227(n)-5, for n >= 2.at n=43A271997
- Number of n-vertex, 2-edge multigraphs that are not nesting. Number of n-vertex, 2-edge multigraphs that are not crossing.at n=18A326278
- Number of free polyaboloes (or polytans) with n cells, where the orientation of two triangles sharing a hypotenuse (making up a square) matters.at n=8A390993
- Triangle read by rows: T(n,k) is the number of free polyforms consisting of k unit square cells and n-k isosceles right triangular cells whose short sides have unit length. Cells are joined along sides of equal lengths.at n=45A391193