5080
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 6440
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2016
- Möbius Function
- 0
- Radical
- 1270
- Omega Function (Ω)
- 5
- 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
- 33
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Theta series of lattice Kappa_7.at n=10A015236
- Expansion of 1/((1-x)(1-9x)(1-12x)).at n=3A016263
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16).at n=50A017865
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=29A024862
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=29A025001
- Dirichlet convolution of triangular numbers with themselves.at n=39A034715
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049615.at n=50A049618
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=29A049779
- Expansion of (1-x)/(1+2*x-2*x^2+2*x^3).at n=8A078055
- Sum of divisors of 3-smooth numbers.at n=45A086417
- Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=25A096223
- Triangle read by rows: T(n,k) counts solid partitions of n such that the maximum of planes, rows, columns and values is k.at n=69A096272
- a(n) = A062402(2^n-1).at n=11A096854
- Consider iteration of the function f(x) = sigma(phi(x)) = A062402(x). Sequence lists the numbers k such that the trajectory of k returns to k.at n=24A096998
- Integer part of the area of consecutive prime sided isosceles triangles.at n=27A097442
- Structured truncated octahedral numbers.at n=9A100155
- Positive integers n such that n^17 + 1 is semiprime (A001358).at n=44A104494
- a(n) = a(n-1) + a(n-3) + a(n-4) + a(n-5) + a(n-7).at n=18A107480
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k pyramids of the first kind (a pyramid of the first kind is a sequence u^pd^p for some positive integer p, starting at the x-axis).at n=40A108451
- Triangle T, read by rows, where T(n,k) = [T^2](n-1,k) + [T^2](n-2,k-1) (n>k>0), with T(n,0) = [T^2](n-1,0) (n>0) and T(n,n) = 1 (n>=0), where T^2 is the matrix square of T.at n=38A109316