1105
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1512
- Proper Divisor Sum (Aliquot Sum)
- 407
- 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
- 768
- Möbius Function
- -1
- Radical
- 1105
- 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
- 93
- 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
- yes
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=33A000223
- Numbers m such that Fibonacci(m) ends with m.at n=33A000350
- Smallest number that is the sum of 2 squares (allowing zeros) in exactly n ways.at n=3A000446
- Smallest number that is the sum of 2 squares in at least n ways.at n=3A000448
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=45A000695
- a(n) = ceiling(n^2/2).at n=47A000982
- 10-gonal (or decagonal) numbers: a(n) = n*(4*n-3).at n=17A001107
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=3A001567
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=23A001844
- Odd squarefree numbers with an odd number of prime factors that have no prime factors greater than 31.at n=46A002556
- Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=1A002997
- Number of rooted triangular cacti with 2n+1 nodes (n triangles).at n=8A003080
- Divisors of 2^24 - 1.at n=36A003532
- Divisors of 2^48 - 1.at n=44A003553
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=21A005238
- Rhombic dodecahedral numbers: a(n) = n^4 - (n - 1)^4.at n=6A005917
- Pseudoprimes to base 3.at n=6A005935
- Pseudoprimes to base 6.at n=5A005937
- Pseudoprimes to base 7.at n=6A005938
- a(n) = n*(n^2 + 1)/2.at n=13A006003