5086
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7632
- Proper Divisor Sum (Aliquot Sum)
- 2546
- 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
- 2542
- Möbius Function
- 1
- Radical
- 5086
- 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
- 178
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T3 for Zeolite Code AEL.at n=47A008006
- 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 70.at n=14A031568
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=1A031826
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 5).at n=54A035583
- Sum of the first n palindromes (A002113).at n=39A046489
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 4).at n=50A046779
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=10A048130
- Record entries in A065191.at n=37A065192
- Numbers k such that k+1, k^2+1 and k^4+1 are primes.at n=26A070325
- To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1.at n=12A087640
- Number of permutations of [n] with exactly 3 descents which avoid the pattern 1324.at n=7A098994
- a(n) = (5*n^2 + n + 2)/2.at n=45A116668
- Number of distinct improper 2-coloring of edges for odd-order cyclic graphs.at n=41A131649
- Smallest number k such that the continued fraction expansion of sqrt(k) contains n distinct numbers.at n=19A187142
- Highest scoring cribbage hand with n cards.at n=14A195676
- Number of -n..n arrays x(0..2) of 3 elements with zero sum and no two neighbors equal.at n=40A199705
- Numbers n such that n!8-1 is prime.at n=46A204662
- Numbers k such that m^2 + k^2/m^2 is prime for every m|k.at n=35A236423
- Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=14A244069
- Numbers n such that A002496(n) mod A002496(n-1) is a perfect square.at n=24A247592