3485
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4536
- Proper Divisor Sum (Aliquot Sum)
- 1051
- 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
- 2560
- Möbius Function
- -1
- Radical
- 3485
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 180
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions into non-integral powers.at n=26A000327
- Number of connected topologies with n unlabeled nodes.at n=7A001928
- Numbers k such that 4!*(2k-5)!/(k!*(k-1)!) is an integer.at n=31A004784
- 5!(2n-6)!/n!(n-1)! is an integer.at n=36A004785
- a(n) = solution to the postage stamp problem with n denominations and 8 stamps.at n=7A005343
- a(n) = n*(2*n + 3).at n=41A014106
- Triangle of q-binomial coefficients for q=-4.at n=17A015112
- Triangle of q-binomial coefficients for q=-4.at n=18A015112
- Gaussian binomial coefficient [ n,2 ] for q = -4.at n=3A015253
- Gaussian binomial coefficient [ n,3 ] for q = -4.at n=2A015271
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=16A015990
- From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=16A019592
- Numbers that are the sum of 2 nonzero squares in exactly 4 ways.at n=11A025287
- Numbers that are the sum of 2 nonzero squares in 4 or more ways.at n=11A025295
- Numbers that are the sum of 2 distinct nonzero squares in exactly 4 ways.at n=11A025305
- Numbers that are the sum of 2 distinct nonzero squares in 4 or more ways.at n=11A025314
- Sequence satisfies T^2(a)=a, where T is defined below.at n=43A027588
- Number of prime unlabeled connected topologies (i.e., prime connected homeomorphism classes) on n points.at n=5A028857
- a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1.at n=24A033498
- Numbers of the form (q^2+(q+1)^2)*(r^2+(r+1)^2), q,r >= 1.at n=34A033682