13885
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16668
- Proper Divisor Sum (Aliquot Sum)
- 2783
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11104
- Möbius Function
- 1
- Radical
- 13885
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Number of solid partitions of n supported on graph of cube.at n=25A003404
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=34A020376
- Number of 2's in n-th term of A022482.at n=35A022485
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=43A067997
- Numbers k such that 7^k + 4 is prime.at n=20A096305
- Minimal exponents m such that the fractional part of (11/10)^m obtains a minimum (when starting with m=1).at n=7A153685
- Numbers k such that the fractional part of (11/10)^k is less than 1/k.at n=11A153686
- Numbers n such that 10^n - 71 is prime.at n=18A178434
- a(n) = 9*n^2 - 13*n + 5.at n=39A214675
- a(n) = (A216363(n) - 1)/118.at n=26A216380
- Egyptian fraction representation of sqrt(84) (A010535) using a greedy function.at n=3A248307
- Indices of zeros in A269783.at n=45A269967
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=32A272421
- Semiprimes that are the sum of the first n odd primes for some n.at n=23A274182
- Expansion of Product_{k>0} (1 - x^k)^(5*k).at n=16A316464
- Sum of the ninth largest parts of the partitions of n into 10 parts.at n=46A326590
- Expansion of g.f. A(x) satisfying A(x)^2 = A( x^2/(1-2*x)^5 ).at n=6A375455