5663
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 817
- 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
- 4848
- Möbius Function
- 1
- Radical
- 5663
- 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
- 85
- 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
- no
- Odd
- yes
Appears in sequences
- Positions of remoteness 6 in Beans-Don't-Talk.at n=45A005694
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=57A011913
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=22A011941
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=34A015990
- a(n) = 4*n^2 - 3*n + 1.at n=38A054552
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.at n=37A058366
- a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))).at n=43A063595
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=33A065214
- Least integer m such that between m and 2m there are n triangular numbers.at n=44A085762
- Integers k such that sigma(k) + prime(k) is divisible by k.at n=6A111360
- Semiprimes in A054552.at n=10A113690
- Numbers k such that k^2 == 2 (mod 23^2).at n=21A156849
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,2,1,0,0 for x=0,1,2,3,4.at n=9A198180
- Number of nX7 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=3A241355
- T(n,k) = Number of n X k 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=48A241356
- Number of 4Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=6A241359
- Exceptional odd numbers D that do not admit a solution to the Pell equation X^2 - D Y^2 = +2.at n=27A263010
- First row of A262057.at n=37A265316
- First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=42A270285
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood.at n=20A271162