14510
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26136
- Proper Divisor Sum (Aliquot Sum)
- 11626
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5800
- Möbius Function
- -1
- Radical
- 14510
- 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
- 58
- 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
- yes
- Odd
- no
Appears in sequences
- Number of Twopins positions.at n=23A005690
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=31A024600
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=30A025114
- Multiplicity of highest weight (or singular) vectors associated with character chi_147 of Monster module.at n=40A034535
- Base-7 palindromes that start with 6.at n=18A043020
- Numbers k such that 295*2^k + 1 is prime.at n=25A053364
- Least k for the Theodorus spiral to complete n revolutions.at n=37A072895
- Partial sums of A003325.at n=39A139211
- a(n)=floor(3*n^2*(2+sqrt(3))).at n=35A172526
- Numbers that are 5-digit palindromes in at least two bases.at n=17A180454
- Sum of distinct prime divisors of Lucas(n).at n=28A219187
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..5 array extended with zeros and convolved with 1,2,2,1.at n=20A222108
- Palindromic numbers in bases 7 and 9 written in base 10.at n=21A259390
- Smallest number that is the sum of n successive primes and also the sum of n successive semiprimes, n > 1.at n=18A283873
- Terms of A005132 corresponding to the values in A330788.at n=22A330789
- Number of compositions (ordered partitions) of n into distinct parts, the least being 6.at n=56A339169
- Numbers k such that 128 * 3^k + 1 is prime.at n=23A388408