17028
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 48048
- Proper Divisor Sum (Aliquot Sum)
- 31020
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 2838
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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 solid partitions of n supported on graph of cube.at n=26A003404
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=41A026054
- Number of binary codes (not necessarily linear) of length n with 4 words.at n=16A034199
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=42A060488
- a(n) = 18*(n - 2)*(2*n - 5).at n=22A060787
- Smallest k such that k*n+1 is a base-2 pseudoprime.at n=58A076748
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively.at n=49A092107
- Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=24A095705
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4.at n=22A114508
- Series expansion for second area weighted moment of osculating polygons on square lattice.at n=6A121768
- a(n) = 9*n*(n+1).at n=43A163758
- a(n) = A192942(n)/2.at n=6A192950
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208752; see the Formula section.at n=59A208751
- Averages y of twin prime pairs that satisfy y = x^2 + x - 2.at n=12A214840
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * Sum_{k=0..n} x^k * {[x^k] A(x)^(2*n)}.at n=10A249935
- Numbers whose binary representation traces a nonselfcrossing circuit in honeycomb lattice when its bits (from the least to the second most significant bit) are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored).at n=43A255571
- Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in order of increasing m.at n=27A256406
- Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in increasing order.at n=28A256407
- Anagrasum integers: integers N that exactly reproduce their set of digits when we form the set of sums of pairs of adjacent digits.at n=33A296521
- Numbers k for which A306927(k) [= A001615(k)-k] is a multiple of A344705(k) [= A001615(k)-A001065(k)], and their quotient is nonnegative.at n=28A344700