1347
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1800
- Proper Divisor Sum (Aliquot Sum)
- 453
- 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
- 896
- Möbius Function
- 1
- Radical
- 1347
- 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
- 65
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=33A000601
- Number of carbon (rooted) trees with n carbon atoms = unordered 4-tuples of ternary trees.at n=11A000678
- Coordination sequence T3 for Zeolite Code EMT.at n=30A008088
- Molien series for A_5.at n=34A008628
- Coordination sequence T2 for Zeolite Code -CHI.at n=23A009847
- Coordination sequence T1 for Zeolite Code RSN.at n=24A009885
- Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.at n=11A014409
- Numbers k such that Fibonacci(k) == 2 (mod k).at n=25A023174
- Convolution of A001950 and A014306.at n=34A023669
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026758.at n=5A027232
- 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 35.at n=13A031533
- Fractional part of square root of a(n) starts with 7: first term of runs.at n=34A034113
- Number of partitions of n into parts 4k+1 and 4k+2 with at least one part of each type.at n=37A035624
- Number of partitions of n into parts 8k+2 and 8k+4 with at least one part of each type.at n=75A035686
- Odd k such that b(k) is less than b(k-1) and b(k+1). b(k): A033178.at n=43A038005
- Coordination sequence T2 for Zeolite Code AFN.at n=26A038402
- Numbers whose base-11 representation has the same nonzero number of 0's and 5's.at n=37A039442
- Numbers whose base-12 representation has the same nonzero number of 4's and 9's.at n=43A039535
- Numerators of continued fraction convergents to sqrt(671).at n=5A042290
- Numbers k such that 0 and 3 occur juxtaposed in the base-8 representation of k but not of k-1.at n=41A043154