13585
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 6575
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 1
- Radical
- 13585
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=44A007333
- Pseudoprimes to base 12.at n=41A020140
- Pseudoprimes to base 56.at n=42A020184
- 2nd elementary symmetric function of first n+1 positive integers congruent to 1 mod 3.at n=9A024212
- a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.at n=32A045973
- Distinct odd numbers in the numerators of the 1/3-Pascal triangle (by row).at n=36A046557
- Distinct odd numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/3-Pascal triangle (by row).at n=31A046561
- a(n) = binomial(n+4,4)*(2*n+1).at n=9A051880
- Smallest number such that the concatenation of first n terms is a proper multiple of the concatenation of first n natural numbers.at n=4A074108
- Number of A095283-primes in range ]2^n,2^(n+1)].at n=17A095293
- Fourth column (m=3) of (1,6)-Pascal triangle A096956.at n=37A096957
- Square array of numbers associated to the recurrences b(k) = b(k-1) + n*b(k-2); array T(n,k), read by descending antidiagonals, for n, k >= 0.at n=51A110112
- Numerator of n-th partial sum of the Van der Waerden-Ulam binary measure of the primes.at n=13A127200
- Row sums of triangle A144275 (called S2hat(-2)).at n=5A144276
- n*(n+1)*(15*n^2-n-8)/12.at n=10A172047
- Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=6.at n=24A172351
- Numbers such that the sum of the largest and the smallest prime divisor equals the sum of the other distinct prime divisors.at n=18A199745
- Primitive (squarefree) elements of A199745.at n=12A200145
- Number of 0..n arrays x(0..4) of 5 elements without any interior element greater than both neighbors or less than both neighbors.at n=9A200873
- Numbers k that form a primitive Pythagorean triple with k' and sqrt(k^2 + k'^2), where k' is the arithmetic derivative of k.at n=11A210503