13893
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20256
- Proper Divisor Sum (Aliquot Sum)
- 6363
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- -1
- Radical
- 13893
- 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
- 107
- 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
- Numbers that are the sum of 8 nonzero 8th powers.at n=20A003386
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=28A031903
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=33A049737
- Numbers k such that 7*10^k + 8*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A103066
- Triangle read by rows: row n gives coefficients of increasing powers of x in characteristic polynomial of the matrix (-1)^n*M_n, where M_n is the tridiagonal matrix defined in the Comments line.at n=49A124037
- a(n) = 7^n - 5^n + 3^n - 2^n.at n=5A135163
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, -1), (0, 1, 1), (1, -1, 0)}.at n=9A148796
- Polynomial expansion of p(x)=1/(1 - 3 x + 2 x^2 + 2 x^3 - 4 x^4 + 4 x^5 - 2 x^6 - 2 x^7 + 3 x^8 - x^9 - x^17 + 3 x^18 - 2 x^19 - 2 x^20 + 4 x^21 - 4 x^22 + 2 x^23 + 2 x^24 - 3 x^25 + x^26).at n=35A164787
- Number of (n+1) X (1+1) 0..2 arrays with the maximum minus the minimum of every 2 X 2 subblock equal.at n=3A237938
- Number of (n+1)X(4+1) 0..2 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=0A237941
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=6A237945
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum minus the minimum of every 2X2 subblock equal.at n=9A237945
- Riordan array ((1-2*x)/(1-3*x+x^2), x/(1-3*x+x^2)).at n=49A238731
- Coordination sequence for "tea" 3D uniform tiling.at n=42A299285
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=9A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=9A345852
- Table in which the g.f. of row n, R(n,x), satisfies Sum_{k=-oo..+oo} (-1)^k * (x^k + n*R(n,x))^k = 1 + (n+2)*Sum_{k>=1} (-1)^k * x^(k^2), for n >= 1, as read by antidiagonals.at n=60A370020
- Expansion of g.f. A(x) satisfying Sum_{n=-oo..+oo} (-1)^n * (x^n + 6*A(x))^n = 1 + 8*Sum_{n>=1} (-1)^n * x^(n^2).at n=5A370026