5890
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- 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)
- 5630
- 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
- 2160
- Möbius Function
- 1
- Radical
- 5890
- Omega Function (Ω)
- 4
- 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
- 80
- 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
- Heptagonal (or 7-gonal) pyramidal numbers: a(n) = n*(n+1)*(5*n-2)/6.at n=19A002413
- a(n) = n*(n+1)*(n+8)/6.at n=30A006503
- Coordination sequence for 5-dimensional cubic lattice.at n=8A008413
- a(0) = 1, a(n) = 23*n^2 + 2 for n>0.at n=16A010013
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite STI = Stilbite Na4Ca8[Al20Si52O144].56H2O starting with a T3 atom.at n=12A019242
- Coordination sequence for C_5 lattice.at n=4A019561
- Number of solutions to c(1)*prime(4) + ... + c(n)*prime(n+3) = 0, where c(i) = +-1 for i>1, c(1) = 1.at n=21A022903
- a(n) = 1*T(n,0) + 2*T(n,1) + ... + (2n+1)*T(n,2n), T given by A027926.at n=8A027992
- Number of aperiodic bracelets (turnover necklaces) with n beads of 5 colors.at n=6A032296
- Second 10-gonal (or decagonal) numbers: n*(4*n+3).at n=38A033954
- Number of points of L1 norm 8 in cubic lattice Z^n.at n=5A035602
- Base-6 palindromes that start with 4.at n=33A043013
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049627.at n=48A049630
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=27A050934
- Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.at n=27A051891
- Array described in A062704 read by diagonals in direction of creation.at n=38A062705
- The array of A062704 read by diagonals in the 'up' direction.at n=42A062706
- a(n) = A000203(n)^2 - A001157(n) = sigma(n)^2 - sigma_2(n).at n=39A066293
- Squarefree numbers having exactly three prime gaps.at n=27A073489
- Numbers having exactly three prime gaps in their factorization.at n=31A073495