4415
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5304
- Proper Divisor Sum (Aliquot Sum)
- 889
- 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
- 3528
- Möbius Function
- 1
- Radical
- 4415
- 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
- 170
- 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
- Powers of sqrt(11) rounded up.at n=7A017939
- Powers of fourth root of 11 rounded up.at n=14A018077
- Expansion of Product_{m>=1} 1/(1 + m*q^m)^5.at n=12A022697
- Place where n-th 1 occurs in A023125.at n=34A022787
- a(n) = least m such that if r and s in {F(h)/F(2*h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers).at n=16A024831
- T(n,n-2), where T is the array in A026148.at n=8A026153
- 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 13.at n=35A031511
- Numbers k such that 237*2^k+1 is prime.at n=12A032495
- McKay-Thompson series of class 31A for Monster.at n=30A058628
- a(0)=1; for n > 0, a(n)=sum(binomial(n,k)*binomial(n+k,k+1)*binomial(n+k+1,k),k=0..n)/n.at n=4A075132
- Interprimes which are of the form s*prime, s=5.at n=11A075280
- Indices n of primes p(n), p(n+4) such that p(n)+1 and p(n+4)+1 have the same largest prime factor.at n=10A105408
- Concatenate n and the sum of primes dividing n (counting multiplicity).at n=43A109958
- n times n+9 gives the concatenation of two numbers m and m+7.at n=0A116342
- Integers k such that 10^k + 63 is a prime number.at n=16A135115
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 5 and 9.at n=12A136991
- A sequence of asymptotic density zeta(7) - 1, where zeta is the Riemann zeta function.at n=36A143033
- a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6 and the operators +, -, *, /, using each number only once.at n=27A143191
- Expansion of Product_{k > 0} (1 + A005229(k)*x^k).at n=21A147880
- 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), (0, 1, -1), (0, 1, 1), (1, 0, 0), (1, 0, 1)}.at n=6A151141