14069
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 1291
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12780
- Möbius Function
- 1
- Radical
- 14069
- 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
- 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
- Number of 3rd-order maximal independent sets in cycle graph.at n=44A007387
- Number of ways to partition 2*n into distinct positive integers not greater than n.at n=32A079122
- Sum of squares of five consecutive primes.at n=13A131686
- Triangle read by rows: T(n,k) = A007318(n-1, k-1) + A001263(n, k) - 1.at n=59A132789
- Triangle read by rows: T(n,k) = A007318(n-1, k-1) + A001263(n, k) - 1.at n=61A132789
- a(n)=a(n-2)+a(n-5).at n=44A133394
- Odd composite numbers such that the sum of any two terms, plus 1, is composite.at n=41A133763
- a(n) = least semiprime such that all subsets of {a(1),...,a(n)} have a different sum.at n=13A137371
- a(n) = 4^n - 3^n - 2^n.at n=7A137786
- Number of Golomb rulers of length n.at n=33A169942
- Number of simple unlabeled graphs on n nodes with exactly 10 connected components that are trees or cycles.at n=13A215980
- Numbers n such that n!!! - 3^10 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=28A265201
- a(n) = A273059(4n).at n=21A275916
- A triple of positive integers (n,p,k) is admissible if there exist at least two different multisets of k positive integers, {x_1,x_2,...,x_k} and {y_1,y_2,...,y_k}, such that x_1+x_2+...+x_k = y_1+y_2+...+y_k = n and x_1x_2...x_k = y_1y_2...y_k = p. For each n, let A(n) = {(p,k):(n,p,k) is admissible for some k}; then a(n) = |A(n)|.at n=43A334246
- a(n) is the Wiener index of a tridon on n vertices.at n=39A349418