14505
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23232
- Proper Divisor Sum (Aliquot Sum)
- 8727
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7728
- Möbius Function
- -1
- Radical
- 14505
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- Index values for new maxima in A065925.at n=18A065926
- a(n) = 8*a(n-1) + 21*a(n-2), with a(1)=1, a(2)=15.at n=4A093117
- Indices of prime Lucas 6-step numbers, A074584.at n=17A105766
- Number of 5-dimensional partitions of n up to conjugacy.at n=15A119340
- The first 10 digits of the fourth root of n contain the digits 0-9.at n=3A119519
- Least k such that k*6*(M(n)^500)-1 is prime where M(i)= i-th Mersenne prime.at n=10A130745
- The nonzero difference between the Pascal {1,8,1} level triangle sequence and the {1,8,1} Catalan generalized triangle: t0(n,m)=Binomial[n, m]*Product[k!*(n + k)!/((m + k)!*(n - m + k)!), {k, 1, 7}]. A(n,k)=(3*n - 3*k + 1)A(n - 1, k - 1) + (3*k - 2)A(n - 1, k); t(n,m)=A(n,m)-t0(n,m). The first three levels and the external columns are zero and extracted.at n=10A142469
- The nonzero difference between the Pascal {1,8,1} level triangle sequence and the {1,8,1} Catalan generalized triangle: t0(n,m)=Binomial[n, m]*Product[k!*(n + k)!/((m + k)!*(n - m + k)!), {k, 1, 7}]. A(n,k)=(3*n - 3*k + 1)A(n - 1, k - 1) + (3*k - 2)A(n - 1, k); t(n,m)=A(n,m)-t0(n,m). The first three levels and the external columns are zero and extracted.at n=12A142469
- a(n) = 392*n + 1.at n=37A158002
- a(n) = 74*n^2 + 1.at n=14A158742
- Totally multiplicative sequence with a(p) = a(p-1) + 7 for prime p.at n=38A166704
- G.f.: exp( Sum_{n>=1} A005651(n)*x^n/n ), where A005651 gives the sums of multinomial coefficients.at n=8A183239
- Number of nX3 0..4 arrays with each element equal to the number its horizontal and vertical neighbors unequal to itself.at n=14A195957
- a(n) = A001567(n) - 2^floor(log_2(A001567(n))).at n=41A295607
- Expansion of e.g.f. 1/(1 - x*(1 + 3*x + x^2)*exp(x)).at n=5A308862
- G.f. A(x) satisfies: A(x) = x + x^2 * exp(3 * Sum_{k>=1} A(x^k) / k).at n=9A345241
- Number of vertices among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square, using only a compass.at n=3A372977