13760
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 33528
- Proper Divisor Sum (Aliquot Sum)
- 19768
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 430
- Omega Function (Ω)
- 8
- 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
- 107
- 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 that are divisible by 10 and are differences between two cubes in at least one way.at n=19A038854
- Numbers whose base-7 representation contains exactly four 5's.at n=10A043416
- Total number of interior nodes in all series-parallel networks with n labeled edges, multiple edges allowed.at n=6A058480
- Nonprimes which terminate in their sum of prime factors.at n=41A071173
- Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).at n=19A081851
- Numbers k for which 8*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A096508
- Number of permutations P of 1..n such that in P and in the inverse of P, every pair of adjacent numbers and the first and last number, are relatively prime.at n=11A117542
- Composite numbers n such that the sum of prime factors of n (counted with multiplicity) terminates n as a substring.at n=40A143993
- 5 times pentagonal numbers: 5*n*(3*n-1)/2.at n=43A152734
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k UUU's (U=(1,1)).at n=61A191518
- Bicolored noncrossing configurations.at n=4A234596
- Expansion of phi(x) * chi(x^2)^4 in powers of x where phi(), chi() are Ramanujan theta functions.at n=45A260514
- Expansion of Product_{k>=1} (1 + 2*k*x^k)/(1 - 2*k*x^k).at n=8A265955
- Expansion of Product_{k>=0} 1/(1-x^(5*k+1))^(5*k+1).at n=38A285049
- Numbers h such that 2^phi(h) == phi(h) (mod h).at n=19A292544
- a(n) = (2*n-3-(-1)^n)*(22*n^2-21*n+5*n*(-1)^n)/96.at n=31A298992
- G.f. B(x) satisfies: Sum_{n>=0} (-1)^n * n * (B(x) - (-1)^n*B(-x))^n = 0.at n=5A318641
- Number of strictly recursively normal integer partitions of n.at n=40A330937
- a(n) = (k+1)*n + k*(k+1)/2, where k = A332542(n).at n=41A332544
- Number of vertices formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.at n=9A358408