5574
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
- 11160
- Proper Divisor Sum (Aliquot Sum)
- 5586
- 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
- 1856
- Möbius Function
- -1
- Radical
- 5574
- 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
- 36
- 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
- Number of trees of diameter 4.at n=30A000094
- Coordination sequence T7 for Zeolite Code EUO.at n=46A008102
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=30A020393
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=43A023177
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=38A024932
- 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 74.at n=8A031572
- Dirichlet convolution of Catalan numbers with Bell numbers.at n=8A034769
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=15A048130
- T(n,n-3), array T as in A054120.at n=11A054121
- Number of log-concave compositions (ordered partitions) of n.at n=37A069916
- Final members of groups in A076105.at n=43A076102
- Numbers k such that k*k! + (smallest prime > k) is prime.at n=27A096986
- Numbers k such that k*k! + (smallest prime >= k) is prime.at n=19A108270
- Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=10A121089
- Number of base 10 n-digit numbers with adjacent digits differing by one or less.at n=6A126364
- Numbers n such that primorial(n)/2 - 16 is prime.at n=21A139444
- Expansion of 1/(1 - x^3 - x^5 - x^7 + x^10), inverse of a Salem polynomial.at n=48A143472
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150349
- Row sums of triangle defined in A113821.at n=21A160969
- Fibonacci sequence rewritten using A006942.at n=18A172439