14893
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15228
- Proper Divisor Sum (Aliquot Sum)
- 335
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14560
- Möbius Function
- 1
- Radical
- 14893
- 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
- 133
- 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
- a(n) = 2^(2*n+1) - C(2*n+3,n+1) + C(2*n+1,n).at n=7A006419
- a(n) = Sum_{k=0..6} binomial(n,k).at n=16A008859
- a(n) = 2^n - C(n,0)- ... - C(n,9).at n=16A035042
- Numbers k such that 2^k + 9 is prime.at n=44A057196
- Number of + signs needed to write the partitions of n (A000041) as sums.at n=25A076276
- Maximum value taken on by f(P) = Sum_{i=1..n} p(i)*p(n+1-i) as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...,n}.at n=35A087035
- Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).at n=38A090285
- Triangle T(n,k), 0<=k<=n, read by rows given by [0,1,2,3,4,5,6,...] DELTA [1,1,1,1,1,1,1,1,...] where DELTA is the operator defined in A084938.at n=43A127160
- Riordan array (1/((1-2x)(1-x)^2), -x/(1-x)^2).at n=59A135552
- 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, 1, 0), (1, 0, -1), (1, 1, 0)}.at n=8A150089
- Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/2).at n=48A187926
- Number of valleys at level 0 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights).at n=16A191389
- Indices of records in A194591 when it is restricted to odd indices.at n=11A194639
- Indices of records in A194591.at n=11A217892
- Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=3A264252
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=18A264257
- Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=2A264260
- Semiprimes of the form p*q where p < q such that q divides p^(q+1) + 1 and (q-p)^(q+1) + 1.at n=11A278921
- Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) / Product_{j>=1} (1 - x^j), where mu() is the Moebius function (A008683).at n=24A281573
- Sum of the fifth largest parts in the partitions of n into 7 parts.at n=44A308929