5030
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 4042
- 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
- 2008
- Möbius Function
- -1
- Radical
- 5030
- 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
- Fibonacci numbers written in base 8.at n=18A004691
- Number of strict 5th-order maximal independent sets in path graph.at n=48A007385
- Coordination sequence T1 for Zeolite Code APD.at n=47A008034
- Coordination sequence T1 for Zeolite Code MEP.at n=42A008157
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=54A009522
- Expansion of Product_{m>=1} (1 - m*q^m)^8.at n=12A022668
- a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=13A024817
- Numbers k such that phi(k) + phi(k+1) = k+2.at n=15A067797
- Numbers k such that A068340(k)=+/-4.at n=6A077032
- A050029(2^n + 1).at n=6A096119
- Index k of the first occurrence of A019565(2n-1) as the smallest term that makes prime(k)-A019565(2n-1) prime.at n=25A103792
- Numbers k such that k + sigma(k) + phi(k) is a triangular number.at n=31A115906
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=18A119864
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 9.at n=28A136891
- Number of 11 X 11 arrays of squares of integers, symmetric about the diagonal and under 90-degree rotation, with all rows summing to n.at n=32A156407
- Number of binary strings of length n with no substrings equal to 0000, 0001, or 1100.at n=15A164415
- Sigma-decagonal numbers: numbers k such that sigma(k) is a decagonal number, that is, sigma(k) = 4*m^2 - 3*m for some nonnegative integer m.at n=43A180937
- Number of (n+1)X(n+1) 0..2 arrays with each 2X2 subblock off diagonal and antidiagonal nonsingular and the array of 2X2 subblock determinants antisymmetric about the diagonal and antidiagonal.at n=3A187701
- T(n,k)=Number of (n+1)X(n+1) 0..k arrays with each 2X2 subblock off diagonal and antidiagonal nonsingular and the array of 2X2 subblock determinants antisymmetric about the diagonal and antidiagonal.at n=13A187705
- Number of 5X5 0..n arrays with each 2X2 subblock off diagonal and antidiagonal nonsingular and the array of 2X2 subblock determinants antisymmetric about the diagonal and antidiagonal.at n=1A187708