14540
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30576
- Proper Divisor Sum (Aliquot Sum)
- 16036
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5808
- Möbius Function
- 0
- Radical
- 7270
- Omega Function (Ω)
- 4
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of products of distinct primes <= p(n) equal to 1 (mod p(n)).at n=20A024405
- Interprimes which are of the form s*prime, s=20.at n=16A075295
- Number of hill-free Dyck paths of semilength n+3 and having no peaks at even levels (a hill in a Dyck path is a peak at level 1).at n=11A114589
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+727)^2 = y^2.at n=6A130646
- Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of n-element unlabeled interval posets of height k.at n=62A193387
- Numbers n such that n!!! - 3^4 is prime.at n=42A247464
- Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its northeast neighbor modulo n and the upper left element equal to 0.at n=3A266653
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northeast neighbor modulo n and the upper left element equal to 0.at n=18A266655
- Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its northeast neighbor modulo 4 and the upper left element equal to 0.at n=2A266657
- Triangle read by rows: T(n,k) is the number of permutations of length n such that the minimum over maximum difference of elements in cycles is exactly k; 0 <= k < n.at n=40A346492