7345
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9576
- Proper Divisor Sum (Aliquot Sum)
- 2231
- 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
- 5376
- Möbius Function
- -1
- Radical
- 7345
- 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
- 163
- 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-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=40A017845
- Pseudoprimes to base 18.at n=37A020146
- Pseudoprimes to base 42.at n=21A020170
- Pseudoprimes to base 44.at n=41A020172
- Pseudoprimes to base 48.at n=39A020176
- Pseudoprimes to base 69.at n=30A020197
- Pseudoprimes to base 71.at n=35A020199
- Pseudoprimes to base 98.at n=40A020226
- Strong pseudoprimes to base 98.at n=11A020324
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=20A020372
- [ (4th elementary symmetric function of P(n))/(2nd elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=13A024535
- Numbers that are the sum of 2 nonzero squares in exactly 4 ways.at n=41A025287
- Numbers that are the sum of 2 distinct nonzero squares in exactly 4 ways.at n=41A025305
- Numbers n such that n and the n-th prime have the same digits.at n=20A074350
- Numbers k such that there are exactly 8 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 8.at n=42A080386
- Convoluted convolved Fibonacci numbers G_6^(r).at n=23A089111
- Row sums of A095167.at n=23A095170
- Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 13 ways.at n=33A097102
- Look at the first 10 digits of the sequence: they are all different. The same for the next 10. And the next 10, etc. This sequence is the slowest increasing one with that property.at n=44A097912
- Coefficients of the A-Rogers mod 14 identity.at n=35A105780