5977
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6160
- Proper Divisor Sum (Aliquot Sum)
- 183
- 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
- 5796
- Möbius Function
- 1
- Radical
- 5977
- 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
- 49
- 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
- E.g.f. log(1 + x/cos(x)).at n=7A009442
- Pseudoprimes to base 42.at n=19A020170
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=11A020417
- Fibonacci sequence beginning 3, 14.at n=14A022125
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=29A031896
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049747.at n=26A049748
- Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.at n=31A064908
- Numbers k such that k divides (prime(3*k) - prime(2*k)).at n=16A066893
- Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) is smallest (n odd) or largest (n even) new number that is the sum of two distinct earlier terms.at n=31A081025
- a(n)= -a(n-1) +5*a(n-2) +5*a(n-3) -a(n-4) -a(n-5).at n=14A107402
- Number of planar partitions of n with all part sizes distinct.at n=30A117433
- Difference between (first Chen prime > 10^n) and 10^n.at n=49A124050
- Row 5 of rectangular table A124530.at n=6A124535
- 1 + 12*n + 81*n^3 + n*(105*n + 81*n^3)/2.at n=3A134163
- Number of 3D matrices with positive integer entries such that sum of all entries equals n.at n=10A159297
- Prime-generating polynomial: a(n) = 4*n^2 + 12*n - 1583.at n=42A182409
- Unhappy numbers which enter the cycle (4, 16, 37, 58, 89, 145, 42, 20) at 20.at n=35A193572
- E.g.f.: -log(cos(x) - x).at n=6A201224
- Values of the first prefixing digits for Mersenne primes.at n=30A209385
- Denominators of the sequence of fractions f(n) defined recursively by f(1) = 9/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal.at n=3A225161