4515
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8448
- Proper Divisor Sum (Aliquot Sum)
- 3933
- 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
- 2016
- Möbius Function
- 1
- Radical
- 4515
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 38
- 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
- Coordination sequence T1 for Zeolite Code RSN.at n=44A009885
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=30A013592
- Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19).at n=42A014561
- Numbers k that divide s(k), where s(1)=1, s(j)=15*s(j-1)+j.at n=30A014865
- Numbers k that divide s(k), where s(1)=1, s(j)=21*s(j-1)+j.at n=26A014872
- a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=28A025003
- 5 times triangular numbers: a(n) = 5*n*(n+1)/2.at n=42A028895
- Least term in period of continued fraction for sqrt(n) is 5.at n=21A031429
- Base-6 palindromes that start with 3.at n=31A043012
- Numbers having three 6's in base 9.at n=7A043479
- For each prime p take the sum of nonprimes < p.at n=28A045717
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=19A046390
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=29A050031
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).at n=48A054669
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).at n=45A054669
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.at n=36A058366
- Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).at n=51A058878
- Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).at n=54A058878
- a(n) = floor(Pi^n mod n^Pi).at n=15A066434
- Harshad numbers which terminate in their digital sum.at n=28A070938