14127
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20016
- Proper Divisor Sum (Aliquot Sum)
- 5889
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8832
- Möbius Function
- -1
- Radical
- 14127
- 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
- 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
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).at n=23A024593
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=22A025107
- "BFK" (reversible, size, unlabeled) transform of 1,3,5,7...at n=13A032046
- Denominators of continued fraction convergents to sqrt(472).at n=13A041901
- Numerators of continued fraction convergents to sqrt(964).at n=5A042864
- Possible traces of n-step walks on 1-D lattice, ignoring translations.at n=17A048248
- Number of nonaveraging subsets on {1,2,...,n}.at n=19A051013
- Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=22A123983
- Total number of restricted right truncatable primes in base n.at n=33A133757
- a(n) = 49*n^2 - 2*n.at n=16A157362
- n-th single or isolated number*n-th non-single or nonisolated number.at n=41A167885
- a(n) = a(n-no-1)+....+a(n-1)+(n-no-2) where no is the 'no+1'th order of the series and 'n' is the element number, here no=6.at n=18A196876
- Number of non-intersecting unit cubes regularly packed into the tetrahedron of edge length n.at n=50A219965
- Numbers k such that (k+1)*2^k - 1 is prime.at n=24A230769
- Number of strings of length n over a three-letter alphabet that begin with a nontrivial palindrome.at n=9A248122
- One half of the even entries of A033317.at n=73A261250
- Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that begin with a palindrome of two or more letters; n, k >= 1.at n=63A342237
- The number of 1+1+1-free ordered posets of [n].at n=8A356111
- Number of distinct lines passing through exactly two points in a triangular grid of side n.at n=23A362014
- Take the solution to Pellian equation x^2 - 8*n*y^2 = 1 with smallest positive y and x >= 0; sequence gives a(n) = y, or 0 if n is twice a positive square. A368340 gives values of x.at n=58A368339