4409
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4410
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 4408
- Möbius Function
- -1
- Radical
- 4409
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 77
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 600
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Balanced primes (of order one): primes which are the average of the previous prime and the following prime.at n=34A006562
- a(n) = (5*n + 1)^2 + 4*n + 1.at n=13A007533
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=19A007765
- Coordination sequence T1 for Zeolite Code APD.at n=44A008034
- Coordination sequence T6 for Zeolite Code BOG.at n=47A008054
- Numbers k such that the continued fraction for sqrt(k) has period 3.at n=16A013643
- Pisot sequences E(6,8), P(6,8).at n=23A020716
- Fibonacci sequence beginning 1, 30.at n=12A022400
- Primes that remain prime through 2 iterations of function f(x) = 8x + 7.at n=32A023263
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=20A023285
- Primes that remain prime through 3 iterations of function f(x) = 6x + 5.at n=37A023288
- Primes that remain prime through 4 iterations of function f(x) = 5*x + 6.at n=5A023315
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=29A023434
- Discriminants of quintic fields with 4 complex conjugates.at n=16A023685
- Least m such that if r and s in {1/2, 1/5, 1/8,..., 1/(3n-1)}, satisfy r < s, then r < k/m < s for some integer k.at n=43A024823
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=40A024840
- Sequence satisfies T^2(a)=a, where T is defined below.at n=50A027591
- Concatenation of n consecutive primes starting with the prime a(n) is a prime.at n=38A030996
- a(n) = prime(100*n).at n=5A031921
- Upper prime of a difference of 12 between consecutive primes.at n=42A031931