5466
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
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 5478
- 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
- 1820
- Möbius Function
- -1
- Radical
- 5466
- 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
- 41
- 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
- Expansion of a modular function for Gamma_0(6).at n=12A002508
- Coordination sequence T4 for Zeolite Code DAC.at n=46A008070
- Pseudoprimes to base 19.at n=29A020147
- Expansion of 1/((1-x)*(1-5*x)*(1-6*x)*(1-12*x)).at n=3A022448
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=33A023863
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric of S(n)) ], where S(n) = {3,4, ..., n+5}.at n=18A024194
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=32A024860
- Denominators of continued fraction convergents to sqrt(775).at n=8A042495
- Numbers having four 3's in base 5.at n=33A043364
- Numbers whose base-2 representation has exactly 12 runs.at n=8A043579
- Numbers n such that 131*2^n-1 is prime.at n=13A050591
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 24.at n=32A051989
- Numbers k such that the binary expansion of 3^k has the same number of 0's and 1's.at n=45A078839
- For n > 0, 0 <= k <= n^2, T(n,k) is the number of rotationally and reflectively distinct n X n arrays that contain the numbers 1 through k once each and n^2-k zeros.at n=21A087074
- a(n) = 3*(a(n-2) + 1), with a(0) = 1, a(1) = 3.at n=14A087503
- a(n) = Sum_{k=0..n} binomial(floor((n+1)/2), floor((k+1)/2)) * 5^k.at n=5A097176
- Number of finite languages over a binary alphabet (set of nonempty binary words of total length n).at n=9A102866
- Numbers n such that sum of n-th and (n+1)-st semiprimes is a square=q^2.at n=37A109311
- Expansion of x*(1+x+2*x^3) / ((x-1)*(1+x)*(3*x^2-1)).at n=16A120463
- Even pseudoprimes to base 19.at n=3A130437