13358
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20040
- Proper Divisor Sum (Aliquot Sum)
- 6682
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6678
- Möbius Function
- 1
- Radical
- 13358
- 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
- 94
- 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
- yes
- Odd
- no
Appears in sequences
- Least m such that if r and s in {1/1, 1/3, 1/6,..., 1/C(n+1,2)} satisfy r < s, then r < k/m < s for some integer k.at n=40A024826
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=25A025515
- Sort then Add, a(1)=19.at n=13A033900
- Smallest number m with nonzero digits such that A046810(m)=n.at n=19A046813
- Number of permutations of n elements not containing the consecutive pattern 123.at n=8A049774
- Numbers k such that k^6 == 1 (mod 7^4).at n=33A056092
- Centered 19-gonal numbers.at n=37A069132
- Main diagonal of table of length of English names of numbers.at n=35A129774
- a(n) = 361*n + 1.at n=36A158310
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2).at n=23A162975
- Exponential Riordan array, defining orthogonal polynomials related to permutations without double falls.at n=36A182822
- Number of (n+2) X 6 0..2 matrices with each 3 X 3 subblock idempotent.at n=12A224602
- Two-Special Pairs in a Free Group.at n=18A237623
- Numbers k that divide A239876(k).at n=9A239877
- Number A(n,k) of permutations of [n] avoiding the consecutive step pattern given by the binary expansion of k, where 1=up and 0=down; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=74A242784
- Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=17A250660
- Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and with no two consecutive increases.at n=7A263642
- Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and with no two consecutive decreases.at n=7A263682
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=32A294872
- a(n) is the number of distinct solution sets to the quadratic equations u*x^2 + v*x + w = 0 with integer coefficients u, v, w, abs(u) + abs(v) + abs(w) <= n having a nonnegative discriminant.at n=32A379597