2603
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2760
- Proper Divisor Sum (Aliquot Sum)
- 157
- 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
- 2448
- Möbius Function
- 1
- Radical
- 2603
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- Number of nontrivial Baxter permutations of length 2n-1.at n=7A001185
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=17A010002
- Least d such that period of continued fraction for sqrt(d) contains n (n^2+2 if n odd, (n/2)^2+1 if n even).at n=50A013945
- a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number.at n=14A022809
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=14A023502
- a(n) = (d(n)-r(n))/5, where d = A026063 and r is the periodic sequence with fundamental period (1,4,0,0,0).at n=32A026065
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 51.at n=0A031549
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 51.at n=0A031729
- Numbers with the property that all pairs of consecutive base-5 digits differ by more than 2.at n=38A032982
- Multiplicity of highest weight (or singular) vectors associated with character chi_67 of Monster module.at n=33A034455
- Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=27A035999
- Denominators of continued fraction convergents to sqrt(208).at n=7A041387
- Numbers whose base-3 representation has exactly 8 runs.at n=17A043588
- Numbers whose number of runs in base 3 is congruent to 1 (mod 7).at n=31A043792
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 8.at n=17A043798
- Numbers n such that number of runs in the base 3 representation of n is congruent to 8 mod 9.at n=17A043814
- Numbers k such that number of runs in the base 3 representation of k is congruent to 8 mod 10.at n=17A043823
- Numbers n such that string 1,2 occurs in the base 9 representation of n but not of n-1.at n=36A044262
- Numbers k such that the string 0,3 occurs in the base 10 representation of k but not of k-1.at n=27A044335
- Numbers k such that string 1,2 occurs in the base 9 representation of k but not of k+1.at n=36A044643