13193
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 247
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12948
- Möbius Function
- 1
- Radical
- 13193
- 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
- 125
- 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 233*2^k+1 is prime.at n=21A032493
- Number of inequivalent connected n-state 1-input n-output automata.at n=5A054749
- a(n+3) = 5*a(n+2) - 2*a(n+1) - 8*a(n), a(0) = 1, a(1) = 5, a(2) = 15.at n=7A110614
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149067
- The largest number m such that sigma(m) = A007368(n), where A007368(n) = the smallest k such that sigma(x) = k has exactly n solutions.at n=35A184394
- Total sum of parts of multiplicity 3 in all partitions of n.at n=31A222731
- Concatenate the n-th prime with the n-th semiprime.at n=31A262428
- Indices of records in the integer sums 1/x0 + x2/x1 +...+ x0/xq of A248954.at n=7A269002
- Number of squarefree parts in the partitions of n into 6 parts.at n=44A309458
- Numbers whose multiset multisystem (A302242) is crossing.at n=34A324170
- MM-numbers of crossing set partitions.at n=12A324324
- Number of integer partitions of n whose number of submultisets is greater than n.at n=35A325831
- Number of integer partitions of n whose number of submultisets is greater than or equal to n.at n=35A325832
- Sum of Fibonacci and tribonacci numbers: a(n) = A000073(n) + A000045(n).at n=18A338192
- Where ones occur in A349085. These correspond to rationals, 0 < p/q < 1, that have a unique solution, p/q = 1/v + 1/w + 1/x + 1/y + 1/z, 0 < v < w < x < y < z.at n=34A349098
- Number of finite sequences of integer partitions with total sum n and all distinct lengths.at n=14A358912
- Integers k for which A000594(k)^2 > 4 k^11, where A000594 is Ramanujan's tau function.at n=29A364087