1163
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1164
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1162
- Möbius Function
- -1
- Radical
- 1163
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 150
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 192
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=40A000057
- Number of primes < prime(n)^2.at n=24A000879
- Primes with 5 as smallest primitive root.at n=30A001124
- Expansion of 1/((1+x)(1-x)^8).at n=6A001779
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=26A003402
- Numbers divisible only by primes congruent to 1 mod 7.at n=33A004619
- Class 4- primes (for definition see A005109).at n=28A005112
- Primes of the form k^2 + k + 41.at n=33A005846
- Smallest prime > n^2.at n=33A007491
- Primes == 3 (mod 8).at n=48A007520
- Primes of form 3*k^2 - 3*k + 23.at n=19A007637
- Coordination sequence T8 for Zeolite Code EUO.at n=21A008103
- Coordination sequence for alpha-Mn, Position Mn3.at n=9A009952
- a(n) is prime and sum of all primes <= a(n) is prime.at n=22A013917
- Number of nodes of odd outdegree in all ordered rooted (planar) trees with n edges.at n=6A014300
- Numbers k such that sigma(k) + 8 = sigma(k+8).at n=43A015915
- From George Gilbert's marks problem: jumping 4 marks at a time (final positions).at n=6A019596
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=29A020357
- Smallest nonempty set S containing prime divisors of 6k+5 for each k in S.at n=51A020603
- Index of 5^n within sequence of numbers of form 3^i*5^j.at n=39A022338