14871
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19832
- Proper Divisor Sum (Aliquot Sum)
- 4961
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9912
- Möbius Function
- 1
- Radical
- 14871
- 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
- 45
- 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
- Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.at n=20A003458
- Number of nonisomorphic cyclic subgroups of the group S_n X S_n (where S_n is the symmetric group of degree n).at n=50A063183
- Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).at n=32A069950
- a(n+1) = floor((1/n)*(Sum_{k=1..n} a(k)^((n+1)/k))), given a(0)=1, a(1)=3, a(2)=8.at n=9A079121
- Number of ways to label the vertices of the octahedron (or faces of the cube) with nonnegative integers summing to n, where labelings that differ only by rotation or reflection are considered the same.at n=34A097513
- Start with 1 and repeatedly reverse the digits and add 55 to get the next term.at n=38A118161
- Numbers k such that prime(k) = A123206(n).at n=6A126094
- a(n) = 676*n - 1.at n=21A158393
- a(n) = 22*n^2 - 1.at n=25A158540
- Numbers k that divide the sum of digits of 21^k.at n=60A175589
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=29A184322
- Power floor sequence of (golden ratio)^5.at n=3A214993
- Natural growth of an aliquot sequence driven by a perfect number 2^(p-1)*((2^p)-1), but starting at 11.at n=16A215778
- Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having directed index change 1,1 2,2 -1,0 or 0,-1.at n=6A264651
- Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having directed index change 1,1 2,2 -1,0 or 0,-1.at n=3A264654
- 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 1,1 2,2 -1,0 or 0,-1.at n=48A264655
- 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 1,1 2,2 -1,0 or 0,-1.at n=51A264655
- Expansion of Product_{k>0} ((1-x^{5k-2}) * (1-x^{5k-3})/((1-x^{5k-1}) * (1-x^{5k-4})))^3 in powers of x.at n=46A285443
- Number of integer partitions of n whose augmented differences are an aperiodic word.at n=35A329136