14541
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20064
- Proper Divisor Sum (Aliquot Sum)
- 5523
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- -1
- Radical
- 14541
- 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
- Odd palindromes in which parity of digits alternates.at n=42A030148
- Palindromic lucky numbers.at n=38A031161
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 80.at n=27A031578
- Lucky numbers that are both palindromic and nonprime.at n=31A031880
- Palindromic Super-2 Numbers.at n=26A032750
- Composite palindromes whose sum of prime factors is palindromic (counted with multiplicity).at n=22A046354
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=44A049750
- Palindromic odd composite numbers that are the products of an odd number of distinct primes.at n=31A075808
- Smallest nontrivial palindromic multiple of the n-th palindrome (a(n) is not equal to the n-th palindrome).at n=47A083145
- Smallest palindromic multiple of n-th palindrome which is not a concatenation of copies of that palindrome.at n=47A083146
- Smallest palindromic multiple (not equal to the number itself) of the palindromes not included earlier.at n=47A085920
- Consider all (2n+1)-digit palindromic primes of the form 70...0M0...07 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M.at n=50A100956
- Palindromes equal to the difference between a prime number and its index.at n=44A115889
- Palindromic mountain numbers.at n=22A173070
- Number of (n+2)X(1+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=4A253112
- Number of (n+2)X(5+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=0A253116
- T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=10A253119
- T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=14A253119
- a(n) = (n^2 - n + 1)*(n^2 + n - 1).at n=10A257925
- E.g.f.: Limit_{N->oo} [ Sum_{n>=0} (N - n)^(2*n) * (x/N)^n/n! ]^(1/N).at n=5A266487