2663
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2664
- 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
- 2662
- Möbius Function
- -1
- Radical
- 2663
- 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
- 84
- 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
- 386
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Seven iterations of Reverse and Add are needed to reach a palindrome.at n=33A015986
- Primes that remain prime through 2 iterations of function f(x) = 10x + 3.at n=48A023269
- Coordination sequence T3 for Zeolite Code CGS.at n=38A027367
- Numerator of |Bernoulli(2n+2)| - |Bernoulli(2n)|.at n=5A029764
- a(n) = prime(9n-1).at n=42A031375
- 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=6A031549
- a(n) = prime(10*n - 4).at n=38A031905
- Lower prime of a difference of 8 between consecutive primes.at n=34A031926
- Primes of form x^2+62*y^2.at n=23A033240
- Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k.at n=17A033548
- a(n) = 2*n^3 + 1.at n=11A033562
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 4).at n=37A035547
- Number of partitions of n into parts 4k+1 and 4k+2 with at least one part of each type.at n=42A035624
- Schoenheim bound L_1(n,8,7).at n=9A036835
- Numerators of continued fraction convergents to sqrt(407).at n=5A041772
- Numbers k such that 0 and 1 occur juxtaposed in the base-11 representation of k but not of k+1.at n=39A044041
- Numbers n such that the string 7,8 occurs in the base 9 representation of n but not of n-1.at n=32A044322
- Numbers n such that string 6,3 occurs in the base 10 representation of n but not of n-1.at n=29A044395
- Numbers n such that string 5,7 occurs in the base 9 representation of n but not of n+1.at n=36A044684
- Numbers n such that string 7,8 occurs in the base 9 representation of n but not of n+1.at n=32A044703