3495
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 2121
- 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
- 1856
- Möbius Function
- -1
- Radical
- 3495
- 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
- 56
- 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
- Expansion of 1/((1-2*x)*(1-x-2*x^3)).at n=10A003478
- A class of rooted trees with n nodes.at n=4A005373
- a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=14A006490
- Numbers k such that sigma(k) = sigma(k+7).at n=13A015867
- a(n) = n*(31*n + 1)/2.at n=15A022289
- Fibonacci sequence beginning 0, 15.at n=13A022349
- Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed).at n=40A023108
- a(n) = [ 2nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=30A025202
- Not necessarily symmetric n X 3 crossword puzzle grids.at n=4A034184
- Multiplicity of highest weight (or singular) vectors associated with character chi_92 of Monster module.at n=36A034480
- Base-4 palindromes that start with 3.at n=32A043005
- Numbers n such that string 9,5 occurs in the base 10 representation of n but not of n-1.at n=37A044427
- Numbers k such that string 9,5 occurs in the base 10 representation of k but not of k+1.at n=37A044808
- Coordination sequence T4 for Zeolite Code DON.at n=40A047956
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=11A049967
- Number of trees with n nodes and 9 leaves.at n=6A055296
- Coordination sequence T4 for Zeolite Code MTF.at n=35A057307
- Coordination sequence T3 for Zeolite Code SFE.at n=39A057319
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=13A063052
- Interprimes which are of the form s*prime, s=15.at n=19A075290