17188
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 30086
- Proper Divisor Sum (Aliquot Sum)
- 12898
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8592
- Möbius Function
- 0
- Radical
- 8594
- Omega Function (Ω)
- 3
- 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
- 27
- 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
- Numbers having four 4's in base 8.at n=5A043440
- Numbers whose base-7 representation has exactly 6 runs.at n=27A043621
- Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.at n=31A091235
- Integers k for which 1 + A094125(k) = 1 + 3*2^k + 2*3^k is prime.at n=22A095378
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=20A157116
- Dispersion of A016873, (5k+3), by antidiagonals.at n=49A191705
- The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=20A192743
- (11*5^n+1)/2.at n=5A199315
- Number of multisets of exactly n nonempty binary words with a total of 2n letters such that no word has a majority of 0's.at n=9A292549
- Number of multisets of exactly nine nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=9A316410
- Number of multisets of exactly ten nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=9A316411