5289
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7392
- Proper Divisor Sum (Aliquot Sum)
- 2103
- 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
- 3360
- Möbius Function
- -1
- Radical
- 5289
- 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
- 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
- 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
- a(n) = floor( n*(n-1)*(n-2)/14 ).at n=43A011896
- Pseudoprimes to base 44.at n=35A020172
- Pseudoprimes to base 85.at n=41A020213
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=42A023180
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=16A024475
- Numbers whose base-2 representation has exactly 11 runs.at n=25A043578
- a(n) = (1/2)*(n-th number whose base-2 representation has exactly 12 runs).at n=27A043686
- Numbers n such that number of runs in the base 2 representation of n is congruent to 1 mod 10.at n=37A043764
- Numbers whose base-4 representation contains exactly three 1's and three 2's.at n=33A045103
- Squarefree nonprimes with property that the concatenation of the prime factors is a palindrome.at n=40A046448
- Numbers that are the product of 3 prime factors whose concatenation is a palindrome.at n=17A046452
- a(n) is the coefficient of the term a^(-n) in the asymptotic series for the least positive zero of the generalized Rogers-Ramanujan continued fraction.at n=8A050203
- a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4).at n=43A050443
- A companion sequence to A011896.at n=43A055610
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.at n=12A058842
- Arithmetic mean of largest subset of {A063676(1), ......., A063676(n-1)} such that a(n) is an integer and a(n) is maximal.at n=40A063678
- a(n) = 3*n^2 + 6*n.at n=41A067725
- Short leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=12A089547
- a(n) = A100092(n^2+n+1).at n=11A100094
- Structured rhombic triacontahedral numbers (vertex structure 11).at n=8A100164