14757
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19680
- Proper Divisor Sum (Aliquot Sum)
- 4923
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9836
- Möbius Function
- 1
- Radical
- 14757
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 102
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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(0)=1, a(n) = 3*a(n-1) + n + 1.at n=8A000340
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.at n=31A008971
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 80.at n=33A031578
- Spiro-tribonacci numbers: a(n) = sum of three previous terms that are nearest when terms arranged in a spiral.at n=32A092360
- A Pascal-like triangle based on 3^n.at n=57A106516
- Triangle read by rows, based on a simple Jacobsthal number recursion rule.at n=57A114163
- Triangle read by rows, iterates of matrix X * [1,0,0,0,...], where X = an infinite lower bidiagonal matrix with [1,3,1,3,1,3,...] in the main diagonal and [1,1,1,...] in the subdiagonal.at n=57A140070
- a(n) = 2*n*(1 + n + n^2 + n^3) - 3.at n=9A155121
- Triangle of polynomial coefficients related to the o.g.f.s. of the RBS1 polynomials.at n=16A160486
- Triangle read by rows: T(n,k) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 8.at n=16A167884
- Triangle read by rows: T(n,k) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 8.at n=19A167884
- Principal diagonal of the convolution array A213836.at n=17A213837
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west or north neighbor modulo n and the upper left element equal to 0.at n=24A266318
- Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its west or north neighbor modulo 4 and the upper left element equal to 0.at n=3A266320