14078
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
- 21120
- Proper Divisor Sum (Aliquot Sum)
- 7042
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7038
- Möbius Function
- 1
- Radical
- 14078
- 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
- 81
- 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
- yes
- Odd
- no
Appears in sequences
- Indices of primes in the sequence defined by A(0) = 31, A(n) = 10*A(n-1) + 71 for n > 0.at n=17A101844
- Numbers whose square is the sum of distinct double factorials (A006882).at n=50A115649
- a(n) = 361*n - 1.at n=38A158308
- a(n) = DP(n) is the total number of k-double-palindromes of n, where 2 <= k <= n.at n=19A180750
- G.f.: exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^3 * x^k]^2 * x^n/n ).at n=7A196559
- Number of simple unlabeled graphs on 2*n nodes with exactly n connected components that are trees or cycles.at n=13A215979
- G.f.: 1/(1 - x*(1-x^6)/(1 - x^2*(1-x^7)/(1 - x^3*(1-x^8)/(1 - x^4*(1-x^9)/(1 - x^5*(1-x^10)/(1 - ...)))))), a continued fraction.at n=20A227375
- Number of partitions p of n such that max(p) - 3*min(p) is a part of p.at n=41A238627
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 622", based on the 5-celled von Neumann neighborhood.at n=33A269567
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 678", based on the 5-celled von Neumann neighborhood.at n=41A273409
- Partial sums of A301692.at n=91A301693
- Number of compositions (ordered partitions) of n into distinct parts, the least being 3.at n=39A339164
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / (exp(x) + exp(y) - exp(x+y))^2.at n=48A382734
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / (exp(x) + exp(y) - exp(x+y))^2.at n=51A382734
- Numbers that can be written in exactly two different ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t} for some t > 0.at n=34A386966
- a(0) = 1; a(n) = (11*n^2 - 9*n + 4)/2 for n>0.at n=51A389625