14559
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20352
- Proper Divisor Sum (Aliquot Sum)
- 5793
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9240
- Möbius Function
- -1
- Radical
- 14559
- 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
- 177
- 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
- Base-7 palindromes that start with 6.at n=19A043020
- Position of first occurrence of 2^n in A057923.at n=21A057925
- Position at which 2^n occurs in A057926, or -1 if it does not occur.at n=22A057928
- a(1) = 1, a(2n) = smallest composite number > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest prime > 2n-th partial sum of the sequence.at n=13A076975
- Number of interior balls in a truncated octahedral arrangement.at n=9A093033
- a(n) = (1/9)(2^(n+3)-(-1)^n(3n-1)).at n=14A103196
- Expansion of (1-2x^2)/((1-2x)(1+x)^2).at n=16A113954
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1100-0101-0111 pattern in any orientation.at n=16A147205
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=24A166393
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w+2x=3y+3z.at n=41A212567
- Sum of column entries of the table with rows of prime numbers (2,3,0,0,...), (0,5,7,11,0,...), (0,0,13,17,19,23,0,...), (0,0,0,29,31,37,41,43,0,...), ...at n=23A238760
- Number of partitions of n where the difference between consecutive parts is at most 4.at n=39A238864
- Number of integers m, 1 <= m <= A002569(n), that are not terms in the triangle T(n,k) of A008284.at n=48A292994
- a(n) is the smallest number whose greedy representation as a sum of terms of A126684 uses n terms.at n=7A302757
- a(n) is the first positive number that has exactly n anagrams which have 3 prime divisors, counted by multiplicity, or 0 if there is no such number.at n=38A369184