13277
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 2275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11200
- Möbius Function
- -1
- Radical
- 13277
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = n*(23*n - 1)/2.at n=34A022280
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=24A025515
- Composite numbers whose prime factors contain no digits other than 1 and 7.at n=35A036307
- Non-palindromic number and its reversal are both multiples of 17.at n=33A062915
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-0110-0011 pattern in any orientation.at n=11A146446
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,4,1,3 for x=0,1,2,3,4.at n=6A196310
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,4,1,3 for x=0,1,2,3,4.at n=3A196313
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,4,1,3 for x=0,1,2,3,4.at n=48A196314
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,4,1,3 for x=0,1,2,3,4.at n=51A196314
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=16A220011
- Numbers n having at least two distinct symmetrical pairs of divisors (a, b) and (b', a') such that n = a*b = b'*a' with a' = reverse(a) and b' = reverse(b).at n=25A228164
- Numbers n such that n^10+10 is prime.at n=21A239347
- Predestined numbers A262743 in which every term is generated by at least one pair of products where all (and only those) first product's factor's digits are, in reverse order, the same as those of the second two factors.at n=41A262873
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=35A320719
- Odd composite integers m such that A000045(3*m-J(m,5)) == 1 (mod m), where J(m,5) is the Jacobi symbol.at n=23A340235
- Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=22A340757
- Products of three distinct strong primes.at n=7A363782
- a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-3*k-2,n-3*k).at n=9A371871