13271
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13872
- Proper Divisor Sum (Aliquot Sum)
- 601
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12672
- Möbius Function
- 1
- Radical
- 13271
- 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
- 76
- 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
- Positive numbers having the same set of digits in base 8 and base 10.at n=41A037442
- a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=24A062158
- a(n) = sum of squares of first n odd primes.at n=14A133547
- a(n) = 25*n^2 + 2*n.at n=22A154377
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 451", based on the 5-celled von Neumann neighborhood.at n=27A272258
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=5A298393
- Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=4A298394
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=49A298396
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=50A298396
- Numbers k not ending in zero that are a substring of k*(k+1).at n=9A305670
- Squarefree integers k such that x^4 - k*y^2 = 1 has a nontrivial solution.at n=27A356496
- Expansion of Sum_{k>0} x^k/(1 - (k*x)^k)^3.at n=9A363650
- a(n) = floor(x*a(n-1)) for n > 0 where x = 3+sqrt(15), a(0) = 1.at n=5A370176