17904
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 46376
- Proper Divisor Sum (Aliquot Sum)
- 28472
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5952
- Möbius Function
- 0
- Radical
- 2238
- Omega Function (Ω)
- 6
- 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
- 92
- 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
- Molien series for alternating group Alt_8 (or A_8).at n=45A008631
- Row sums of triangle A054336 (central binomial convolutions).at n=11A054341
- Antidiagonal sums of array in A093966.at n=10A093963
- a(n) = 16*(8*prime(n) + 7).at n=33A098823
- a(n) = 512*n - 16.at n=34A157447
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with distinct entries (0<=k<=n).at n=59A181302
- Number of ways to place 3 nonattacking grasshoppers on a chessboard of size n x n.at n=6A190395
- Number of permutations generated by passing an ordered sequence of length n through a stack of depth 2 and an infinite stack in series.at n=8A245233
- Sum of first n Honaker primes.at n=13A276255
- Numbers k such that (268*10^k - 1)/3 is prime.at n=19A293531
- Sum over all partitions of n of the bitwise XOR of the parts.at n=26A306903
- Number of 4-element subsets of [n] whose sum is a triangular number.at n=47A320850
- Number of regions in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and n+2 equally spaced points along the diameter (a total of 2n+2 points). See Comments for precise definition.at n=14A333519
- a(n) = a(n-1) + a(n-3) unless a(n-1) and a(n-3) are both even in which case a(n) = (a(n-1) + a(n-3))/2, with a(0) = a(1) = a(2) = 1.at n=34A341312
- a(n) is the number of labeled rooted ordered binary trees T where the nodes are labeled with distinct positive integers, the root has label n, each parent label equals the sum of its children labels, and T cannot be extended.at n=21A348851
- Number of curved edges among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle when every pair of the 3 + 3*n points are connected by a circle and where the points lie at the ends of the circle's diameter.at n=5A372733