3403
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3528
- Proper Divisor Sum (Aliquot Sum)
- 125
- 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
- 3280
- Möbius Function
- 1
- Radical
- 3403
- 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
- yes
- 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
- 61
- 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
- a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=13A001210
- Coefficients of period polynomials.at n=21A006308
- Number of stable towers of 2 X 2 LEGO blocks.at n=8A007575
- a(n) = p*(p-1)/2 for p = prime(n).at n=22A008837
- Second hexagonal numbers: a(n) = n*(2*n + 1).at n=41A014105
- Odd triangular numbers.at n=41A014493
- Binomial coefficients C(n,81).at n=2A017745
- Binomial coefficients C(83,n).at n=2A017799
- Smallest triangular number that begins with n.at n=33A018855
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=21A024588
- n written in fractional base 5/3.at n=28A024633
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=21A024845
- Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).at n=30A025064
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=20A025102
- Coordination sequence T3 for Zeolite Code ITE.at n=40A027371
- (prime(n)-1)(prime(n)-3)/8.at n=37A030005
- 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 57.at n=16A031555
- a(n) = (2*n-1)*(4*n-1).at n=21A033567
- Lexicographically earliest sequence of pairwise coprime triangular numbers.at n=8A034792
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+1 or 16k-1.at n=55A036020