13058
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
- 4
- Divisor Sum
- 19590
- Proper Divisor Sum (Aliquot Sum)
- 6532
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6528
- Möbius Function
- 1
- Radical
- 13058
- 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
- 169
- 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
- [ n(n-1)(n-2)(n-3)/11 ].at n=21A011921
- Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.at n=33A064842
- a(n) = 7^n + 8^n + 9^n.at n=4A074580
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).at n=55A078658
- Symmetric square table, read by antidiagonals, such that antidiagonal sums form the first row shifted left: T(0,0)=1, T(0,k) = Sum_{m=0..k-1} T(m,k-1-m) when k > 0; and T(n,k) = T(n-1,k) + T(n,k-1) when n > 0, k > 0.at n=56A084867
- Records in A087159, i.e., A087159(a(n)) = n, and satisfies the recurrence a(n+3) = 5*a(n+2) - 6* a(n+1) + 2*a(n) with a(1) = 1, a(2) = 2, and a(3) = 4.at n=9A087161
- Diagonal sums of Riordan array ((1-2x)/(1 - 3x + x^2),x(1-x)/(1 - 3x + x^2)).at n=10A147704
- 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, -1, 1), (-1, 0, 0), (0, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149442
- a(n) = 6561*n^2 - 7732*n + 2278.at n=1A157376
- a(n) = 3*n^4 + 12*n^3 + 30*n^2 + 36*n + 17.at n=7A160827
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=37A183898
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-1,0,1,2}, n=3*r+p_i, and define a(-1)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,3,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^3-2*x) with x=2*cos(Pi/9).at n=31A187505
- Numbers which are the sums of consecutive fourth powers.at n=40A217844
- Numbers that are the sum of fourth powers of three distinct positive integers in arithmetic progression.at n=17A306214
- Number of strict integer partitions of 2*n with no subset summing to n.at n=36A321142
- Numbers m such that the average path sum is an integer when iterating from m to 1 with nondeterministic map k -> k - k/p, where p is any prime factor of k.at n=46A333785