14109
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18816
- Proper Divisor Sum (Aliquot Sum)
- 4707
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9404
- Möbius Function
- 1
- Radical
- 14109
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=21A031838
- Number of primitive (aperiodic) step shifted (decimated) sequences using exactly three different symbols.at n=9A056387
- a(n) = ((3*n + 1)*2^(n+3) + 9 + (-1)^n)/18.at n=10A102301
- a(n) = 8*n^2 - 3.at n=41A108928
- Convolution of the (signless) central Stirling numbers of the first kind (A187646).at n=4A187656
- Number of 2nX4 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=3A198448
- Number of 2nX8 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=1A198450
- T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=11A198452
- T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=13A198452
- Expansion of 1/(1 - Sum_{k>=2} (1 - floor(2/d(k)))*x^k), where d(k) is the number of divisors (A000005).at n=44A280544
- Numbers n such that the decimal equivalent of the binary reflected Gray code representation of n is a palindromic prime.at n=35A281382
- a(0)=0, then a(n) = smallest odd k > a(n-1) such that 6*k^prime(n)-1 is prime.at n=39A283676
- Number of rectangular twice-partitions of n of type (P,R,P).at n=33A358833