3413
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3414
- 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
- 3412
- Möbius Function
- -1
- Radical
- 3413
- 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
- 17
- 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
- 480
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Related to series-parallel networks.at n=11A001572
- a(n) = Sum_{k=1..n} k^k.at n=5A001923
- If a, b in sequence, so is ab+7.at n=30A009312
- a(n) is prime and sum of all primes <= a(n) is prime.at n=45A013917
- Numbers k such that the continued fraction for sqrt(k) has period 13.at n=21A020352
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...).at n=18A024479
- [ Sum (s(j) - s(i))^3 ], 1 <= i < j <= n, where s(k) = 1 + 1/2 + ... + 1/k.at n=48A025217
- a(n) = diagonal sum of right justified array T given by A027113.at n=9A027132
- Coordination sequence T3 for Zeolite Code CGS.at n=43A027367
- Coordination sequence T2 for Zeolite Code ITE.at n=40A027370
- Coordination sequence T4 for Zeolite Code ITE.at n=40A027372
- Coordination sequence T1 for Zeolite Code SAT.at n=42A027373
- a(n) = n + (n+1)^2 + (n+2)^3 + (n+3)^4 + (n+4)^5.at n=1A027622
- Primes of form n + (n+1)^2 + (n+2)^3 + (n+3)^4 + (n+4)^5.at n=0A027886
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 16.at n=2A031604
- Lower prime of a difference of 20 between consecutive primes.at n=3A031938
- Primes of form x^2+41*y^2.at n=24A033228
- Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Big-endian concatenation of decimals.at n=47A035514
- Positive numbers having the same set of digits in base 7 and base 9.at n=18A037439
- Denominators of continued fraction convergents to sqrt(500).at n=10A041955