13960
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31500
- Proper Divisor Sum (Aliquot Sum)
- 17540
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5568
- Möbius Function
- 0
- Radical
- 3490
- Omega Function (Ω)
- 5
- 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
- 151
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 59.at n=27A031557
- Numbers k such that 129*2^k-1 is prime.at n=34A050590
- Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).at n=17A081852
- Number of partitions of n with unique smallest part and unique largest part.at n=44A117298
- Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros.at n=51A126442
- The total number of ways of partitioning the multiset {1,1,1,1,2,3,...,n-3}.at n=6A169588
- Given M = triangle A122196 as an infinite lower triangular matrix, this sequence is lim_{k->infinity} M^k.at n=29A171238
- A(x) satisfies A005408(x) = A(x)/A(x^2), A005408 = odd numbers.at n=21A173283
- (A178476(n)-3)/9.at n=17A178486
- Number of partitions of 2n into parts such that the largest multiplicity equals n.at n=45A232697
- E.g.f.: exp(10*x*G(x)^9) / G(x)^9 where G(x) = 1 + x*G(x)^10 is the g.f. of A059968.at n=4A251580
- Numbers k such that 63*10^k + 1 is prime.at n=21A271361
- Expansion of Product_{k=1..12} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=33A320246
- Starts of runs of 5 consecutive even numbers that are all totient numbers (A002202).at n=43A333022
- Number of terms in polynomial sequence s(n) = x*y*z*(s(n-1)*s(n-3) + s(n-2)^2)/s(n-4), with s(1) = x, s(2) = s(3) = 1, s(4) = y.at n=23A338218
- Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=59A346426
- Triangle read by rows: T(n,k) is the number of permutations of length n such that the minimum over maximum difference of elements in cycles is exactly k; 0 <= k < n.at n=38A346492
- Number A(n,k) of walks on square lattice from (n,k) to (0,0) using steps that decrease the Euclidean distance to the origin and increase the Euclidean distance to (n,k) and that change each coordinate by at most 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=46A346540
- Number A(n,k) of walks on square lattice from (n,k) to (0,0) using steps that decrease the Euclidean distance to the origin and increase the Euclidean distance to (n,k) and that change each coordinate by at most 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=53A346540
- Number of partitions of the (n+6)-multiset {0,...,0,1,2,...,6} with n 0's.at n=4A346859