11603
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11928
- Proper Divisor Sum (Aliquot Sum)
- 325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11280
- Möbius Function
- 1
- Radical
- 11603
- 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
- 81
- Smith Number
- no
- 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
- a(n) = A047980(2n).at n=27A047981
- Numbers of partitions of 2n into n primes.at n=40A102108
- Positions of records in A034694.at n=40A120857
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UDUDU's (n >= 0; 0 <= k <= n-2 for n >= 2).at n=40A128753
- a(n) = A139480(n)/2.at n=24A139481
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, -1)}.at n=8A150049
- Indices j in A000040 such that j is an odd composite and the distinct digits of the prime A000040(j) are in increasing order.at n=36A155775
- Partial sums of ceiling(Fibonacci(n)/4).at n=22A179042
- Number of 8-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=15A186984
- Number of distinct functions f representable as x -> x^x^...^x with n x's and parentheses inserted in all possible ways giving result f(0)=0, with conventions that 0^0=1^0=1^1=1, 0^1=0.at n=14A222379
- Expansion of 1 / Sum_{k>=0} (-x)^(k*(3*k - 1)/2).at n=38A308806
- Numbers missing from A317415.at n=32A317417
- a(n) is the smallest m such that A144261(m) = n.at n=42A358067
- Indices for A358168.at n=4A358180