14065
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
- 8
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 3575
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- -1
- Radical
- 14065
- 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
- yes
- 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
- 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
- Number of genus 1 rooted maps with 2 faces with n vertices.at n=3A006295
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=34A020384
- Decimal part of a(n)^(1/8) starts with reversal of its integer part: first term of runs.at n=2A034314
- Composite numbers k, not a power of 2, such that the E(k) == 1 (mod k), where E(k) is the k-th Euler number (A000364).at n=38A035163
- [ (phi + sqrt(phi))^n ], phi = (1+sqrt(5))/2.at n=9A050242
- Pentagonal numbers (A000326) whose digit reversal is a prime.at n=16A115707
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=42A116721
- Pentagonal numbers with prime indices.at n=24A116995
- Pentagonal numbers divisible by 5.at n=39A117793
- Pentagonal numbers that are the sum of a nonzero pentagonal number and a nonzero square in at least one way.at n=34A134938
- Number of different fixed (possibly) disconnected tetrominoes bounded tightly by an n X n square.at n=7A163434
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,2,1,0,0 for x=0,1,2,3,4.at n=10A198180
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209830; see the Formula section.at n=50A209831
- Number of n-digit 8th powers.at n=37A216658
- Triangle read by rows: T(n,f) is the number of rooted maps with n edges and f faces on an orientable surface of genus 1.at n=11A269921
- Triangle read by rows: T(n,f) is the number of rooted maps with n edges and f faces on an orientable surface of genus 1.at n=13A269921
- Triangle read by rows: T(n,g) is the number of rooted maps with n edges and 2 faces on an orientable surface of genus g.at n=10A270406
- Triangle read by rows: T(n,g) is the number of rooted maps with n edges and 4 faces on an orientable surface of genus g.at n=5A270408
- a(n) is the number of rooted maps with n edges and 4 faces on an orientable surface of genus 1.at n=1A288071
- E.g.f. A(x) satisfies: [x^n] A(x)^n = n^2 * [x^(n-1)] A(x)^n for n>=1.at n=4A300616