13199
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13464
- Proper Divisor Sum (Aliquot Sum)
- 265
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12936
- Möbius Function
- 1
- Radical
- 13199
- 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
- 99
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=23A031781
- Geometric mean of the digits = 3. In other words, the product of the digits is = 3^k where k is the number of digits.at n=33A061427
- Semiprimes n such that 3*n + 4 is a square.at n=23A112666
- a(n) = n^3 - (n+1)^2.at n=24A153257
- a(n) = 400*n - 1.at n=32A158317
- a(n) = (2*n+1)*(6*n-1).at n=33A179741
- Number of lower triangles of a 3 X 3 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=13A195249
- Number of partitions of n such that neither the number of parts nor the number of distinct parts is a part.at n=38A241380
- First occurrence of 2*n in A035096.at n=41A247234
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=21A273640
- a(n) is the smallest k such that (n+1)*phi(k) = (n-1)*psi(k).at n=48A291932
- Number of unlabeled rooted trees with n vertices such that every branch of the root has the same number of leaves.at n=13A298533
- The sequence denoted by d_n used in the calculation of A323260.at n=9A323263
- a(1) = a(3) = 0, and otherwise a(n) is the least multiple of prime(n) whose decimal representation ends with that of prime(n+1).at n=44A333845
- Odd composite integers m such that A004254(3*m-J(m,21)) == 5*J(m,21) (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol.at n=40A340240
- G.f. A(x) satisfies A(x) = 1 - x/A(x)^2 * (1 - A(x) - A(x)^5).at n=7A371915
- Numerators of the partial sums of the reciprocals of the number of abelian groups function (A000688).at n=39A379359