5891
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6072
- Proper Divisor Sum (Aliquot Sum)
- 181
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- 1
- Radical
- 5891
- 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
- 80
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of (1+x^2-x^3)/(1-x)^4.at n=30A027378
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 75.at n=27A031573
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=38A033951
- The sequence e when b=[ 1,1,0,1,1,... ].at n=44A042955
- a(n) = 2^(n-1)*(3*n-4) + 3.at n=9A048496
- a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=27A050071
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=32A064906
- Indices of zeros in A079777.at n=11A073853
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=32A079094
- a(n) = 6*n^2 + 4*n + 1.at n=31A080859
- Numerator of I(n) = Integral_{x=0..1/(4^n)} (1-sqrt(x))^2 dx; e.g., I(3) = 323/24576. The denominator is b(n) = 96*16^(n-1); e.g., b(3) = 24576.at n=5A092841
- Row sums of triangle A096811, in which A096811(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-2).at n=30A096814
- Look at the first 10 digits of the sequence: they are all different. The same for the next 10. And the next 10, etc. This sequence is the slowest increasing one with that property.at n=41A097912
- Positive integers of the form (18*m^2+1)/11.at n=10A113338
- Semiprimes in A033951.at n=13A113691
- Numbers n such that twice the sum of the prime factors of n equals the product of the digits of n.at n=19A125309
- 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, 1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=9A148206
- Triangle T(n,k) read by rows: Sum_{k=0..binomial(n,2)} T(n,k)*q^k = n!*Sum_{pi} faq(n,q)/Product_{i=1..n} e(i)!*faq(i,q)^e(i), where pi runs over all nonnegative integer solutions to e(1) + 2*e(2) + ... + n*e(n) = n and faq(i,q) = Product_{j=1..i} (q^j-1)/(q-1), i = 1..n.at n=36A152474
- Number of nondecreasing integer sequences of length 19 with sum zero and sum of absolute values 2n.at n=11A158153
- Positive integers of the form (2*m^2+1)/11.at n=32A179088