17864
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
- 32
- Divisor Sum
- 43200
- Proper Divisor Sum (Aliquot Sum)
- 25336
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 4466
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 141
- Smith Number
- yes
- 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
- Susceptibility series for b.c.c. lattice.at n=5A002914
- Base-8 Armstrong or narcissistic numbers (written in base 10).at n=15A010354
- a(n) = (n-1)*(2*n-1)*(3*n-1).at n=15A033594
- Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=41A035952
- a(n) = prime(2^n) + 1.at n=11A051440
- First number of height n in Recamán's sequence A005132.at n=17A064290
- Total number of odd parts in all partitions of n.at n=26A066897
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=44A073798
- a(n) = n*(n+1)*(2n+1)*(3n+1)*(4n+1)/30.at n=7A094323
- Numbers k such that 9*10^k + 4*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=6A103097
- Number of permutations of length n which avoid the patterns 1234, 3142, 4132.at n=9A116788
- a(n) = {2^n}_n.at n=12A122636
- Number of benzenoids with 23 hexagons, C_(2v) symmetry and containing n carbon atoms.at n=12A123142
- a(n) = A000124(n)*a(n-3) for n > 2, otherwise n!.at n=10A123151
- a(n) = n*(n+1)*(11*n+1)/6.at n=21A132112
- Base-11 Armstrong or narcissistic numbers (written in base 10).at n=21A161948
- Base 8 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-8 digits, for some k.at n=36A162231
- Numbers k such that 10^(2*k+1)-5*10^k-1 is prime.at n=5A183185
- k such that 10^(2*k+1)-j*10^k-1 is prime for some j = 1, 2, 4, 5, 7 or 8.at n=34A213881
- Number of 4X4X4 triangular 0..n arrays with every horizontal row nondecreasing and having the same average value.at n=9A214908