14895
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25896
- Proper Divisor Sum (Aliquot Sum)
- 11001
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 0
- Radical
- 4965
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- Numbers k such that 75*2^k+1 is prime.at n=38A032387
- a(n) = floor((n^3)/2).at n=31A036487
- Sum of the heights of the second peaks in all Dyck paths of semilength n+2.at n=7A112308
- Triangle of numbers obtained from the partition array A134274.at n=16A134275
- a(n) = 392*n - 1.at n=37A158004
- a(n) = 784*n - 1.at n=18A158399
- a(n) = 76*n^2 - 1.at n=13A158765
- a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 4.at n=30A160892
- a(n) = ((2*n+1)^3+(-1)^n)/2.at n=15A175109
- Coefficient array for orthogonal polynomials p(n,x)=(x-(2n-1))*p(n-1,x)-(2n-2)^2*p(n-2,x), p(0,x)=1,p(1,x)=x-1.at n=21A182826
- E.g.f. 1/sqrt(1+2x+4x^2).at n=6A182827
- Floor(1/{(8+n^4)^(1/4)}), where {}=fractional part.at n=30A184632
- Number of permutations of 1..n with displacements restricted to {-5,-4,-3,-1,0,2}.at n=14A189587
- Number of representations of n as a sum of products of pairs of positive integers, n = Sum_{k=1..m} i_k*j_k with i_k<=j_k, i_k<=i_{k+1}, j_k<=j_{k+1}, i_k*j_k<=i_{k+1}*j_{k+1}.at n=33A212214
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w=floor((x+y+z)/2).at n=30A212747
- Number of partitions of n that include a pair of consecutive integers.at n=36A237666
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=29A240271
- Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=6A240272
- a(n) = 4*n^3 - 6*n^2 + 3*n - 1.at n=15A268201
- Number of compositions (ordered partitions) of n into distinct nonprime parts.at n=49A331917