17728
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
- 14
- Divisor Sum
- 35306
- Proper Divisor Sum (Aliquot Sum)
- 17578
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8832
- Möbius Function
- 0
- Radical
- 554
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 22
- 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 overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.at n=23A015128
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=19A045037
- Number of subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).at n=45A064803
- a(n) = A000695(A014486(n)).at n=13A083931
- XOR difference triangle, read by rows, of A099898 (in leftmost column) such that the main diagonal equals A099898 shift left and divided by 4.at n=29A099897
- Row sums of triangle A137639.at n=34A137640
- A(x) satisfies A005408(x) = A(x)/A(x^2), A005408 = odd numbers.at n=22A173283
- Expansion of g.f.: -1/(-1 + x + x^4 - x^10 + x^13 + x^14).at n=33A174578
- Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A235019
- Number of (n+1) X (5+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235023
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=10A235026
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=14A235026
- Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n with respect to the symmetries of the square.at n=20A277086
- Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n with respect to the symmetries of the square.at n=32A277086
- Start with the square tile of the Shield tiling and recursively apply the substitution rule. a(n) is the number of triangles with 6 markings after n iterations.at n=8A298681
- Number of ways to choose a rooted partition of each part in a strict rooted partition of n.at n=19A301751
- Number of factorizations of 2^n into factors > 1 with integer average.at n=46A326667
- The number of edges on an octagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.at n=2A333110
- The excess of the number of partitions of n with more odd parts than even parts over the number of partitions of n with more even parts than odd parts.at n=41A338860
- Number of integer partitions of n with parts disjoint from first differences of parts, meaning no part is the difference of two consecutive parts.at n=49A363260