5893
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 155
- 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
- 5740
- Möbius Function
- 1
- Radical
- 5893
- 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
- 98
- 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
- Numbers k such that 9*2^k - 1 is prime.at n=24A002236
- Coordination sequence T1 for Coesite.at n=41A008267
- First differences of A037260.at n=26A037261
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 22.at n=27A051963
- a(n) = n^3 + prime(n).at n=17A089620
- a(n) = prime(n)*prime(n+3).at n=19A090090
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=24A112560
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 8 multiples of n-1, n-2, ..., 1, for n>=1.at n=39A113745
- Brilliant numbers (A078972) whose digit reversal is the product of 2 palindromes greater than 1.at n=18A115681
- Start with 1 and repeatedly reverse the digits and add 60 to get the next term.at n=43A118162
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=6A145292
- a(n) = least k such that either 6*k*M(n)-1 or 6*k*M(n)+1 or both is prime, where M(i)= i-th Mersenne prime.at n=24A145983
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1000-1010-1111 pattern in any orientation.at n=15A146811
- Products of exactly two Pillai primes.at n=34A181414
- Expansion of 1/(1 - x - x^2 + x^8 - x^10).at n=19A181600
- Prime-generating polynomial: a(n) = 25*n^2 - 1185*n + 14083.at n=39A181963
- Number of n X 5 binary arrays with each 1 adjacent to exactly one 1 vertically and one 1 horizontally.at n=9A183337
- a(n) = A001209(n) + 1.at n=24A196069
- Ceiling((n+1/n)^6).at n=3A197905
- Round((n+1/n)^6).at n=3A198071