14839
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
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 2441
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12600
- Möbius Function
- -1
- Radical
- 14839
- 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
- 71
- 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
- Number of segments created by diagonals of n-gon.at n=19A014629
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 2, -1, 1, 2.at n=14A025259
- For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer.at n=33A029591
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=50A035546
- a(n) = n*(13*n^2 - 7)/6.at n=19A062025
- Non-palindromic number and its reversal are both multiples of 19.at n=30A062916
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=19A071861
- Expansion of x*(3*x-1)*(2*x-1) / ( (1-x)*(1+x)*(x^2-4*x+1) ).at n=10A107388
- a(n) = numerator of Sum_{k=1..n} k^mu(n+1-k), where mu(m) = A008683(m).at n=10A130491
- Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=5.at n=23A143456
- Number of n X 9 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.at n=2A163721
- Number of n X 3 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent.at n=8A163724
- a(n) = (2*n+1)*(6*n-1).at n=35A179741
- Number of 5-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=16A187379
- Fibonacci sequence beginning 13, 7.at n=16A206611
- Lucas pseudoprimes.at n=13A217120
- a(n) = n*(21*n-17)/2.at n=38A226491
- 24-hedral numbers: a(n) = (2*n + 1)*(8*n^2 + 14*n + 7).at n=9A254473
- Numbers n which are neither palindromes nor the sum of two palindromes, with property that the largest palindrome which when subtracted from n yields the sum of two palindromes is not the palindromic floor of n (A261423(n)), but rather the next palindrome below that.at n=39A261911
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 4 (mod m), where U(m)=A001353(m) and V(m)=A003500(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=4 and b=1, respectively.at n=37A337778