13887
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20072
- Proper Divisor Sum (Aliquot Sum)
- 6185
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9252
- Möbius Function
- 0
- Radical
- 4629
- Omega Function (Ω)
- 3
- 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
- 257
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Expansion of (3 + x^2) / (1 - x)^4.at n=26A037237
- Sum of first 2n primes.at n=39A109722
- Successive sums of consecutive primes that form a triangular grid.at n=11A125130
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)+1 are twin primes with p(h) = h-th prime.at n=31A129310
- Sum of primes < n^2.at n=20A139562
- n-th prime*8-7 is the square of a prime.at n=43A169583
- Number of strings of numbers x(i=1..n) in 0..6 with sum i*x(i)^4 equal to n*1296.at n=9A184845
- Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 + x5*x6 = n, with all xi >= 1.at n=59A191832
- Dimensions of the hypoplactic subalgebra of the Hopf algebra PMN_1.at n=4A231490
- Terms of A007504 divisible by 3.at n=23A249679
- Coordination sequence for (2,4,5) tiling of hyperbolic plane.at n=32A265060
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=28A270463
- G.f. A(x,y) satisfies: A(x,y) = x + A( x^2 + x*y*A(x,y)^2, y).at n=75A271868
- Number of n X 3 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=11A316422
- Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k symmetric valleys, with k >= 0.at n=33A372875
- Numbers k such that prime(k) and prime(k) + 9*k are anagrams.at n=46A379738