13022
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 7714
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6112
- Möbius Function
- -1
- Radical
- 13022
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers whose sum of divisors is a fourth power.at n=33A019422
- T(2n+1, n+1), T given by A026758.at n=7A026876
- Expansion of 1/((1-5*x)*(1-7*x)*(1-10*x)*(1-12*x)).at n=3A028188
- a(n) = floor(47*(n-3/2)^(3/2)).at n=42A050256
- T(n,n-3), array T as in A054110.at n=31A054112
- a(n) = (7-(-5)^n)/6.at n=7A166122
- Numbers n such that n^16+1 and (n+2)^16+1 are both prime.at n=22A217991
- Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 8.at n=55A245148
- a(n) is the number of subsets of {1, 2, ..., n} with product of all entries <= n^2 + n.at n=52A298880
- a(0) = a(1) = 0, a(2) = 1; a(n) = a(n-1) + Sum_{k=0..n-3} a(k) * a(n-k-3).at n=24A357308
- G.f. A(x) satisfies A(x) = 1 / ((1 + x) * (1 - x * (1 + x) * A(x^2))).at n=17A367716
- a(n) = (n - 1) * Sum_{k=2..n} A000010(k).at n=34A385682
- Array read by antidiagonals: T(n,k) is the number of sets of k integer sided cuboids with distinct volumes that fill an n X n X n cube.at n=71A387121