5788
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
- 6
- Divisor Sum
- 10136
- Proper Divisor Sum (Aliquot Sum)
- 4348
- 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
- 2892
- Möbius Function
- 0
- Radical
- 2894
- Omega Function (Ω)
- 3
- 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
- 54
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 64.at n=26A020403
- 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 38.at n=32A031536
- Partial sums of primes congruent to 1 mod 6.at n=33A038349
- Numbers having four 4's in base 6.at n=6A043388
- Sum of transposition distances (divided by 2) present in the permutation produced by inverses of 1..(p-1) computed in Zp, where p is n-th prime.at n=45A051864
- Numbers k such that k^128 + 1 is prime.at n=16A056994
- a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=19A064022
- Molien series for action of SL(3,C) on ternary forms of degree 4.at n=25A083024
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, a(6) = 16, for n>5: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6)], where SORT places digits in ascending order and deletes 0's.at n=44A108567
- Shadow of sqrt(2).at n=34A110557
- Numbers n such that 1 - Sum_{k=1..n-1} A001223(k)*(-1)^k = 0.at n=35A128039
- Triangle read by rows: A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (n + 1)*(n + 2)*A(n - 2, k - 1).at n=37A153658
- a(n) = number of primes p, p <= 2^n, where 2^n + p is composite.at n=16A175148
- Triangle read by rows: T(n,k) = 1 + (q-binomial coefficient [n,k] for q=4) - binomial(n,k).at n=17A176422
- Triangle read by rows: T(n,k) = 1 + (q-binomial coefficient [n,k] for q=4) - binomial(n,k).at n=18A176422
- A126789 with zeros removed.at n=39A176623
- "Complement" of Pol's E-toothpick sequence after n iterations.at n=55A220745
- Number of (n+1)X(2+1) 0..2 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=9A233403
- Numbers that set a new integer record for the ratio between the product and the sum of their digits.at n=22A240520
- a(n) = ( 2*n*(2*n^2 + 9*n + 14) + (-1)^n - 1 )/16.at n=27A248851