14113
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15408
- Proper Divisor Sum (Aliquot Sum)
- 1295
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12820
- Möbius Function
- 1
- Radical
- 14113
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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
- a(n) = T(2n,n+1), T given by A026736.at n=7A026850
- Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,3.at n=4A037637
- Numbers k such that replacing each nonzero digit d with the d-th prime (replacing each 0 digit with a 1) yields a square.at n=7A048383
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.at n=35A050797
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.at n=41A058366
- Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.at n=31A060495
- Each permutation in the list A060117 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.at n=29A060498
- Each permutation in the list A060118 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's.at n=27A060499
- Third row of Pascal-(1,3,1) array A081578.at n=42A081585
- 63-gonal numbers: a(n) = n*(61*n - 59)/2.at n=22A098140
- Semiprimes of the form 2*n + 1, where n is a square.at n=36A111351
- First row of Modified Schroeder numbers for q=9 (A114295).at n=13A114299
- a(n) = numerator of Sum_{k=1..n} k^mu(n+1-k), where mu(m) = A008683(m).at n=8A130491
- The number of different configurations of an n-block of a shift space with k symbols where each symbol but the first must appear isolated and separated from others by an block of length at least m made of first symbol. Here k=49 and m=2.at n=5A131601
- a(n) = 18*n^2 + 1.at n=27A157889
- a(n) = 392*n + 1.at n=36A158002
- a(n) = 441*n + 1.at n=31A158322
- a(n) = 32*n^2 + 1.at n=21A158575
- a(n) = 72*n^2 + 1.at n=14A158740
- a(n) = 6*a(n-1)-8*a(n-2)+3 for n > 1; a(0) = 1, a(1) = 8.at n=6A171479