1165
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1404
- Proper Divisor Sum (Aliquot Sum)
- 239
- 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
- 928
- Möbius Function
- 1
- Radical
- 1165
- 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
- 119
- Smith Number
- yes
- 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
- Number of equivalence classes of n X n matrices over {0,1} with rows and columns summing to 3, where equivalence is defined by row and column permutations.at n=9A000512
- Generating function = Product_{m>=1} 1/(1 - x^m)^2; a(n) = number of partitions of n into parts of 2 kinds.at n=12A000712
- Sum of Fermat coefficients.at n=9A000967
- Primes multiplied by 5.at n=50A001750
- Expansion of (psi(-x) / phi(-x))^5 in powers of x where phi(), psi() are Ramanujan theta functions.at n=6A001939
- Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=19A001975
- a(n) = n*(7*n^2 - 1)/6.at n=10A004126
- a(n) = a(n-1) + 4*a(n-2), a(0) = a(1) = 1.at n=8A006131
- Smith (or joke) numbers: composite numbers k such that sum of digits of k = sum of digits of prime factors of k (counted with multiplicity).at n=51A006753
- The generalized Conway-Guy sequence w^{0}.at n=12A006754
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=25A007333
- Coordination sequence T2 for Zeolite Code EMT.at n=28A008087
- Coordination sequence T2 for Zeolite Code YUG.at n=22A008248
- Coordination sequence for Paracelsian.at n=23A008260
- Number of n-dimensional partitions of 5.at n=9A008779
- Coordination sequence T7 for Zeolite Code CON.at n=24A009874
- Positive integers n such that 2^n == 2^5 (mod n).at n=41A015925
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19).at n=58A017895
- Pseudoprimes to base 89.at n=23A020217
- Numbers k such that the continued fraction for sqrt(k) has period 19.at n=9A020358