5950
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 7442
- 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
- 1920
- Möbius Function
- 0
- Radical
- 1190
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 49
- 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
- Expansion of 1/((1-x)^4*(1+x)).at n=39A002623
- a(n) = n*(n+4)*(n+5)/6.at n=30A005586
- a(n) = n*(n+1)*(4*n+5)/6.at n=20A016061
- a(n) = n*(19*n + 1)/2.at n=25A022277
- Expansion of Product_{m>=1} (1+m*q^m)^30.at n=3A022658
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=39A023856
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=38A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).at n=38A024853
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=17A048189
- Even numbers not the sum of a pair of twin lucky numbers.at n=58A057702
- Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(7).at n=10A058857
- Triangle T(n,m) giving number of m-element intersecting antichains on a labeled n-set or n-variable Boolean functions with m nonzero values in the Post class F(7,2), m=0,.., A037952(n).at n=37A059090
- Numbers k such that k and its reversal are both multiples of 17.at n=19A062906
- Non-palindromic number and its reversal are both multiples of 17.at n=11A062915
- Record entries in A065191.at n=41A065192
- Number of (binary) bit strings in which no even length block of 0's is followed by an even length block of 1's.at n=13A065494
- Sum of the digits of the n-th Mersenne prime (A000668).at n=19A066538
- Numbers m that divide binomial(m*(m+1), m+1)/m^2.at n=38A082529
- To obtain a(n+1), add the square of the n-th partial sum to the n-th partial sum of the squares, then divide this result by a(n), for all n >= 0, with a(0)=1.at n=8A088016
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^4-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=32A096035