14231
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 3049
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11448
- Möbius Function
- -1
- Radical
- 14231
- 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
- yes
- 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
- Numerators of continued fraction convergents to sqrt(299).at n=4A041562
- Numbers n for which there are exactly four k such that n = k + reverse(k).at n=34A072428
- Non-balanced numbers in A015771.at n=25A078549
- (prime(n)*(prime(n+1)-1) + (prime(n)-1)*prime(n+1)) / 2.at n=28A099909
- Total number of parts smaller than the largest part, in all partitions of n.at n=24A116686
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=36A131647
- Numbers k = p*q*r (p, q, r prime) congruent to 0 mod p+q+r.at n=24A160394
- The non-common part of the smaller number of an amicable pair.at n=17A180326
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=4A196296
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=3A196297
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=31A196300
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4.at n=32A196300
- Numbers which, when divided by the sum of their prime factors, give a prime number.at n=41A199013
- Odd numbers m that are neither of the form p + 2^k nor of the form p - 2^k with 2^k < m, k >= 1, and p prime.at n=17A255967
- Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals four.at n=12A288543
- Odd squarefree composite numbers k, divisible by the sum of their prime factors, sopfr (A001414).at n=15A308643
- Lerch pseudoprimes: composite numbers m such that Sum_{k=1..m-1} k^{m-1} - (m-1)! == m (mod m^2).at n=4A308963
- a(n) is the number of vertices formed by n-secting the angles of a decagon.at n=31A335801
- G.f. A(x) satisfies: A(x) = x^2 + x^3 * exp(A(x) - A(x^2)/2 + A(x^3)/3 - A(x^4)/4 + ...).at n=34A346032