17113
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17380
- Proper Divisor Sum (Aliquot Sum)
- 267
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16848
- Möbius Function
- 1
- Radical
- 17113
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Shifts left under transform T where Ta is (identity) DCONV a.at n=43A038046
- Third row of Pascal-(1,5,1) array A081580.at n=31A081589
- Consider the 2^n compositions of n and count only those ending in an even part.at n=9A123639
- Number of nX3 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=8A166831
- Values of the first prefixing digits for Mersenne primes.at n=28A209385
- Numbers of the form 4^j + 9^k, for j and k >= 0.at n=38A226828
- Numbers k^2 + (k+1)^2 that can be expressed as a sum of two squares in exactly one other way.at n=40A239527
- a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).at n=11A261232
- a(n) = 32*n^2 - 56*n + 25.at n=24A272129
- a(n) = 2*A090495(n) - 1.at n=31A274297
- Numbers of the form a^6 + b^7, with integers a, b > 0.at n=16A303376
- Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=8A317400
- Numbers k such that phi(k) > phi(k+1) > phi(k+2) > phi(k+3) where phi is the Euler totient function (A000010).at n=28A326817
- a(1) = a(3) = 0, and otherwise a(n) is the least multiple of prime(n) whose decimal representation ends with that of prime(n+1).at n=28A333845
- Number of vertices formed inside a right triangle by the straight line segments mutually connecting all vertices and points on the two shorter edges whose positions equal the Farey series of order n.at n=6A359968
- Centered square numbers which are semiprime.at n=42A371016
- Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes.at n=14A376352