17703
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
- 12
- Divisor Sum
- 29328
- Proper Divisor Sum (Aliquot Sum)
- 11625
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- 0
- Radical
- 5901
- 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
- 79
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=21A004949
- a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=21A004969
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 19.at n=6A031697
- Number of partitions of primes into mutual coprimes > 1.at n=35A086191
- Row sums in A100781.at n=20A100784
- <h[d+1,d-1],s[d,d]*s[d,d]*s[d,d]> where h[d+1,d-1] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions.at n=34A115376
- G.f.: 1/(1 -2 x^3 - x^4 + x^5).at n=36A122518
- 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, -1, 1), (0, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, 1)}.at n=7A151108
- a(n) = 361*n^2 + 2*n.at n=6A158309
- a(n) = Least i in range [A165598(n),A165598(n+1)] for which abs(A165597(i)) gets the maximum value in that range.at n=4A165599
- a(n) = Fibonacci(n+6) - Fibonacci(6).at n=16A180671
- Expansion of 1/(1 - x - x^2 + x^18 - x^20).at n=21A185357
- s(k)-s(j), where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=25A205864
- s(k)-s(j), where the pairs (k,j) are given by A205872 and A205873, and s(k) denotes the (k+1)-st Fibonacci number.at n=15A205874
- Number of partitions p of n such that (number of numbers in p of form 3k+2) < (number of numbers in p of form 3k).at n=43A241740
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=35A244791
- Number of symmetric difference-closed 4-sets consisting of the empty set and sets consisting of pairwise disjoint 2-subsets of {1,2,...,n}.at n=8A267840
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=4A318012
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A318013
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=31A318016