14711
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15072
- Proper Divisor Sum (Aliquot Sum)
- 361
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14352
- Möbius Function
- 1
- Radical
- 14711
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^5 *product_{i=1..t} (1-x^i) ).at n=16A059822
- Positive integers not appearing in sequence A098572, which calculates the values of floor(sum(m^(1/m),n=1..m)).at n=46A098573
- Numbers that are the product of two distinct primes a and b, such that a^3+b^3 is the average of a twin prime pair.at n=40A176876
- 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=30A184322
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >=n.at n=13A210366
- Numbers k such that 13^k + k^13 + 1 is prime.at n=4A216421
- a(n) = smallest number greater than n, equal to the determinant of the circulant matrix formed by its base-n digits.at n=25A219357
- Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.at n=8A264373
- G.f.: Product_{k>=1} (1 + x^(k^3)) / (1 - x^k).at n=31A280278
- Square array A(m,n) = number whose binary expansion is the concatenation of those of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=17A285806
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=4A316803
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=2A316805
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=23A316808
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=25A316808
- Numbers k such that 461*2^k+1 is prime.at n=6A323200
- Integers k for which A000594(k)^2 > 4 k^11, where A000594 is Ramanujan's tau function.at n=33A364087