14209
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15316
- Proper Divisor Sum (Aliquot Sum)
- 1107
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13104
- Möbius Function
- 1
- Radical
- 14209
- 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
- 89
- 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
- Number of certain rooted planar maps.at n=6A000305
- a(n) = a(n-1) + 3*a(n-2) for n > 1, a(0) = a(1) = 1.at n=12A006130
- Numbers k that divide 9^k + 4^k.at n=4A045593
- Numbers k such that 2^k mod k = 2^k mod k^2.at n=32A068535
- Wieferich numbers (1): n > 1 such that 2^A000010(n) == 1 (mod n^2).at n=5A077816
- a(n) = n * (6*n^2 + 6*n + 1).at n=12A094421
- a(n) = n*(n^3 - n + 2)/2.at n=13A101374
- Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.at n=41A123015
- Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=18A125773
- a(n) = 3*a(n-2) - a(n-1) for n > 1, a(0) = 0, a(1) = 1.at n=13A182228
- Minimal order of degree-n irreducible polynomials over GF(3).at n=20A218356
- a(n) = 384*n + 1.at n=37A229853
- Number of partitions p of n such that m(p) <= m(c(p)), where m = minimal multiplicity of parts, and c = conjugate.at n=34A240730
- Numbers m such that m^2 divides 2^k - 1 for some k, 0 < k <= m.at n=8A246503
- Triangle T(n,k) (0 <= k <= n) giving coefficients of certain polynomials related to Fibonacci numbers.at n=40A259708
- Numbers n > 1 such that 2^m == 1 (mod n^2), where m = A002326((n-1)/2).at n=4A265630
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 350", based on the 5-celled von Neumann neighborhood.at n=33A271303
- Halogen sequence: a(n) = A018227(n)-1.at n=41A271999
- Number of partitions of n for which the number of even parts is equal to the positive alternating sum of the parts.at n=50A277579
- Numbers n > 1 such that 2^lambda(n) == 1 (mod n^2), where lambda(n) is the Carmichael lambda function (A002322).at n=5A291961