17792
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 35700
- Proper Divisor Sum (Aliquot Sum)
- 17908
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 8832
- Möbius Function
- 0
- Radical
- 278
- Omega Function (Ω)
- 8
- 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
- 48
- 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 solutions to Langford (or Langford-Skolem) problem (up to reversal of the order).at n=10A014552
- Sizes of successive increasing gaps between 3-smooth numbers.at n=39A084788
- Maxima in A163169.at n=40A163172
- Products of the 7th power of a prime and a distinct prime (p^7*q).at n=35A179664
- Monotonic ordering of nonnegative differences 6^i-2^j, for 40>=i>=0, j>=0.at n=42A192117
- Monotonic ordering of nonnegative differences 6^i-4^j, for 40>= i>=0, j>=0.at n=23A192164
- Number of Langford pairings of order n, as n runs through the positive numbers congruent to -1 or 0 mod 4.at n=4A192289
- Number of n X 5 arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=3A221416
- T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=31A221419
- Number of 4Xn arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=4A221422
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=14A287510
- Primitive practical numbers of the form 2^i * prime(k).at n=32A308710
- Number of normal multiset partitions of weight n where each part has a different size.at n=8A326517
- a(n) is the smallest abundant number of the form 2^e * prime(n).at n=32A341361
- The smallest number such that exactly n numbers k exist such that a(n) - k = sopfr(a(n)) + sopfr(k), where sopfr(m) is the sum of the primes dividing m, with repetition.at n=9A370091
- a(n) = A376877(n) / p where p is the largest prime factor of A376877(n).at n=35A376874
- Numbers which can be written in precisely one way as sum of a subset of their proper divisors and that have exactly one subset of their divisors such that the complement has the same sum.at n=46A378530