14148
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36960
- Proper Divisor Sum (Aliquot Sum)
- 22812
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4680
- Möbius Function
- 0
- Radical
- 786
- Omega Function (Ω)
- 6
- 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
- 32
- Smith Number
- yes
- 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
- Numbers that are the sum of 8 nonzero 8th powers.at n=21A003386
- Number of step shifted (decimated) sequences using exactly three different symbols.at n=9A056377
- Numbers k such that sigma(k) = 2*usigma(k).at n=39A063880
- a(n) = (n^3 - 7*n + 12)/6.at n=43A105163
- a(n) = (n+1)*(n+2)^2*(n+3)*(7*n^2 + 23*n + 20)/240.at n=7A114240
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x + 97)^2 = y^2.at n=10A129836
- Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=38A132885
- A007318 * triangle M, where M = A002426 * 0^(n-k), 0<=k<=n.at n=52A135091
- G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^3)^6.at n=6A137970
- A117852*A130595 as lower triangular matrices.at n=47A171128
- prime(n^2) - prime(n).at n=40A213926
- Number of compositions of n into parts {3,4,5} when all parts 3,4 and 5 are present.at n=27A243254
- a(n) = binomial(n-h,h)*hypergeometric([h-n/2,h-(n-1)/2],[1],4), h = floor(n/4).at n=11A246659
- Sum of numbers on n-th segment of Ulam's spiral.at n=47A257171
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 or -1,-2.at n=37A264285
- Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,0 0,1 1,0 or -1,-2.at n=7A264286
- Numbers k such that (35*10^k - 11)/3 is prime.at n=30A268448
- Sums of the next n consecutive nonsquare integers.at n=30A275740
- Wiener index for the n-Andrásfai graph.at n=43A292018
- Number of integer partitions of n such that the dual of the multiset partition obtained by factoring each part into prime numbers is a (strict) antichain, also called T_1 integer partitions.at n=37A326977