14252
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28560
- Proper Divisor Sum (Aliquot Sum)
- 14308
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6096
- Möbius Function
- 0
- Radical
- 7126
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 164
- 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
- yes
- Odd
- no
Appears in sequences
- Aliquot sequence starting at 180.at n=24A008891
- Number of nonprimes <= prime(n)^2.at n=30A053683
- G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).at n=39A090491
- (Number of primes == 3 mod 4 less than 10^n) - (number of primes == 1 mod 4 less than 10^n).at n=10A091295
- Number of binary strings of length n with equal numbers of 00011 and 00101 substrings.at n=15A164229
- Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y).at n=27A213045
- Numbers n such that in Collatz (3x+1) trajectory of n, the number of terms < n equals number of terms > n.at n=31A217731
- Numbers k such that 10^k - 987654321 is prime.at n=4A248352
- a(n) = (3 + 2*n - 3*n^2 + 4*n^3 - 3*((-1 + n) mod 2))/6.at n=27A304487
- Number of integer partitions of n whose parts plus 1 are relatively prime.at n=34A318980
- Number of compositions of n with strictly increasing differences.at n=43A325547
- Numbers k such that usigma(uphi(k)) = uphi(usigma(k)), where usigma is the sum of unitary divisors function (A034448) and uphi is the unitary totient function (A047994).at n=36A329730
- G.f. A(x,y) = lim_{N->infinity} (1 - P(N,x,y))/(2*x)^N, where P(0,x,y) = -y, and P(n+1,x,y) = sqrt(1 - 4*x + 4*x*P(n,x,y)) for n = 0..N-1.at n=41A352093
- a(n) = Sum_{k = floor((n+1)/2)..n} (-1)^(n+k)*binomial(n,k)*binomial(n+k-1,k)*binomial(2*k,n).at n=5A363983
- a(0) = 1; thereafter a(n) = 10*n^2 - 5*n + 2.at n=38A383466