13090
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 31104
- Proper Divisor Sum (Aliquot Sum)
- 18014
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- -1
- Radical
- 13090
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- a(n) = 2*binomial(n,3).at n=35A007290
- Expansion of Product_{k>=1} (1 - x^k)^14.at n=13A010821
- a(n) = floor(binomial(n,4)/4).at n=35A011850
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A025177.at n=9A025180
- Numbers whose set of base-16 digits is {2,3}.at n=26A032816
- Number of partitions of n into parts not of the form 25k, 25k+2 or 25k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 11 are greater than 1.at n=40A036001
- Products of exactly 5 distinct primes.at n=36A046387
- Number of independent components for a Weyl tensor in n dimensions.at n=17A052472
- Greatest common divisor of largest square dividing n! and squarefree part of n!.at n=55A055230
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=49A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=50A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=71A075837
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=72A075837
- Number of primes of the form 7k+6 less than 10^n.at n=5A091125
- Dimensions of the irreducible representations of the simple Lie algebra of type G2 over the complex numbers, listed in increasing order.at n=44A104599
- A002415 and A052472 interlaced.at n=38A117651
- a(n) = floor(n*(n+2)*(n+4)*(n-6)/192).at n=40A117652
- a(n) is the smallest unused number such that the RMS (Root Mean Square) of a(1) through a(n) is an integer.at n=40A141391
- a(n) = RMS( A141391(1) through A141391(n) ).at n=40A141392
- a(n) = RMS( A141391(1) through A141391(n) ).at n=39A141392