5286
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 5298
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1760
- Möbius Function
- -1
- Radical
- 5286
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 103
- 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
- a(n) = ceiling(1000*log_2(n)).at n=38A004267
- Coordination sequence T5 for Zeolite Code EUO.at n=45A008100
- Coordination sequence T1 for Zeolite Code SGT.at n=45A008229
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=40A023177
- 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 72.at n=4A031570
- a(n)=(s(n)+2)/9, where s(n)=n-th base 9 palindrome that starts with 7.at n=40A043078
- Numbers whose base-4 representation contains exactly three 1's and three 2's.at n=32A045103
- a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.at n=17A046809
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=12A048130
- McKay-Thompson series of class 31A for Monster.at n=31A058628
- Numbers k such that 4^k - 3 is prime.at n=23A059266
- a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=29A063676
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is a right integer triangle.at n=15A070136
- Number of n-digit terms of A070153.at n=31A071297
- Positions of A080299 in A014486.at n=18A080298
- Number of minimal generators for toric ideal associated with path with n nodes.at n=8A090382
- Number of iterations of the sine function to be less than 1/n with an initial argument of Pi/2 radians.at n=41A092906
- Total number of odd lists in all sets of lists, cf. A000262.at n=6A102289
- Coefficients of the C-Rogers mod 14 identity.at n=37A105782
- 5th diagonal of triangle in A059317.at n=17A106113