14027
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15372
- Proper Divisor Sum (Aliquot Sum)
- 1345
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12792
- Möbius Function
- 0
- Radical
- 1079
- Omega Function (Ω)
- 3
- 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
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Expansion of Product_{m>=1} (1-m*q^m).at n=38A022661
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=25A031781
- Numbers having four 3's in base 8.at n=10A043436
- If p | n, then p+1 | n+1 for composite n.at n=43A056729
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.at n=30A061153
- Numbers k that, when expressed in base 6 and then interpreted in base 7, give a multiple of k.at n=6A062934
- Number of n-node connected graphs with one cycle, possibly of length 1 or 2.at n=11A068051
- Numbers that define integer Heronian triangles [a(n), prime(a(n)), A068968(n)] with area A068969(n).at n=32A068967
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.at n=12A074128
- Partial sums of A068148.at n=25A178137
- a(n) = 8*n^2 + 14*n + 5.at n=41A181890
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined below in Comments.at n=14A192422
- Number of cyclotomic cosets of 11 mod 10^n.at n=41A220021
- Number of (n+1)X(1+1) 0..3 arrays x(i,j) with row sums sum{j*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=3A232678
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=6A232680
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=9A232680
- Numbers n such that (2^(n+3) * 5^(n+4) - 1463)/9 is prime (n > 0).at n=7A265123
- The successive digits of the sequence are the same digits that have a nonprime rank in the sequence.at n=58A284213
- Bases b where exactly seven primes p with p < b exist such that p is a base-b Wieferich prime.at n=31A325883
- Composite numbers k coprime to 8 such that k divides Pell(k - Kronecker(8,k)), Pell = A000129.at n=30A327651