1103
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1104
- 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
- 1102
- Möbius Function
- -1
- Radical
- 1103
- 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
- 44
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 185
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=19A000355
- a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.at n=52A000916
- Primes with 5 as smallest primitive root.at n=28A001124
- Smallest natural number requiring n letters in English.at n=26A001166
- Number of graphs with n nodes and n-1 edges.at n=9A001433
- Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=47A001578
- Number of letters in English name for n increases at these numbers.at n=18A001619
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=15A001836
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=21A002515
- An infinite coprime sequence defined by recursion.at n=4A002715
- Numbers that are the sum of 11 positive 5th powers.at n=49A003356
- Divisors of 2^29 - 1.at n=2A003537
- Divisible only by primes congruent to 4 mod 7.at n=33A004622
- Primes written in base 4.at n=22A004678
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=38A004922
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=38A004942
- Sophie Germain primes p: 2p+1 is also prime.at n=41A005384
- Numbers k such that k-6, k, and k+6 are primes.at n=29A006489
- Balanced primes (of order one): primes which are the average of the previous prime and the following prime.at n=15A006562
- Emirps (primes whose reversal is a different prime).at n=44A006567