3473
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3648
- Proper Divisor Sum (Aliquot Sum)
- 175
- 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
- 3300
- Möbius Function
- 1
- Radical
- 3473
- 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
- 105
- 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 generalized partition function.at n=17A002598
- a(n) = Sum_{k=0..5} binomial(n,k).at n=14A006261
- a(n) = 2^(2*n+1) - C(2*n+3,n+1) + C(2*n+1,n).at n=6A006419
- Coordination sequence T1 for Zeolite Code AWW.at n=42A008045
- Coordination sequence T1 for Zeolite Code DDR.at n=37A008071
- Coordination sequence T2 for Zeolite Code EPI.at n=37A008091
- Coordination sequence T1 for Zeolite Code KFI.at n=45A008123
- Powers of fifth root of 11 rounded down.at n=17A018144
- Powers of fifth root of 11 rounded to nearest integer.at n=17A018145
- Define the sequence S(a(0),a(1)) by a(n+2) is the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n) for n >= 0. This is S(4,12) (agrees with A019481 for n <= 19 only).at n=6A019480
- a(n) = 3*a(n-1) + a(n-2) - 2*a(n-3) (agrees with A019480 for n <= 19 only).at n=6A019481
- Numbers k such that the continued fraction for sqrt(k) has period 38.at n=38A020377
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=16A026066
- a(n) = sum of the numbers between the two n's in A026366.at n=30A026369
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 24 (most significant digit on right and removing all least significant zeros before concatenation).at n=7A029541
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 24 ones.at n=39A031792
- a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,8).at n=14A035041
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=2A036260
- Numbers n such that string 7,3 occurs in the base 10 representation of n but not of n-1.at n=37A044405
- Numbers n such that string 7,3 occurs in the base 10 representation of n but not of n+1.at n=37A044786