17140
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 36036
- Proper Divisor Sum (Aliquot Sum)
- 18896
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6848
- Möbius Function
- 0
- Radical
- 8570
- Omega Function (Ω)
- 4
- 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
- 172
- 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
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=30A037235
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.at n=39A051941
- Numbers which are the sum of their proper divisors containing the digit 8.at n=10A059467
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+857)^2 = y^2.at n=6A129857
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1), (1, 1, -1)}.at n=8A149467
- Row sums of A163233 and A163235 divided by 3.at n=40A163478
- Numbers k such that the digit sum of 167^k is divisible by k.at n=32A175552
- G.f. A(x) satisfies: A(x) = exp( Sum_{n>=1} B(x^n)/n ) where B(x) = Series_Reversion(x/A(x)) = g.f. of A179325.at n=8A192637
- Number of partitions of 5n such that cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5) < cn(0,5).at n=14A202086
- (1/n)*A205126(n).at n=64A205127
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=24A219699
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=28A244906
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k*(k+1))).at n=44A280424
- Number of Golomb partitions of n.at n=45A325858
- a(n) = Sum_{k=0..n} (n+1)*2^(n+k)*hypergeom([-n, k-n+1], [2], 1/2). Row sums of A337617.at n=5A337992
- Number of ways to write n as an ordered sum of 10 primes.at n=12A340966
- Sorted positions of first appearances in A057820, the sequence of first differences of prime-powers.at n=46A376340