14720
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36720
- Proper Divisor Sum (Aliquot Sum)
- 22000
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5632
- Möbius Function
- 0
- Radical
- 230
- Omega Function (Ω)
- 9
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Number of odd split numbers (A036382) of which the binary order (A029837) is <= n, i.e., those which occur below 2^n.at n=15A036388
- Number of partitions satisfying 0 < cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(4,5) + cn(2,5) + cn(3,5).at n=35A039901
- (k^2)-th k-smooth number for k = prime(n).at n=17A133581
- Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x + d)^n - (x - d)^n)/(2*d), where d = sqrt(x+4).at n=64A162517
- Row sums of table A164341.at n=9A164342
- Partial sums of A061262.at n=28A176661
- Sums of two successive primes s such that s+-3 are primes.at n=29A179485
- Numbers with prime signature {7,1,1}, i.e., of form p^7*q*r with p, q and r distinct primes.at n=17A179696
- Numerator sequence of the n-th convergent of the continued fraction 1/(1-2/(2-2/(3-2/(4-...at n=7A222470
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes L, X.at n=23A234312
- Number of (n+2) X (1+2) 0..2 arrays with each 3 X 3 subblock having the sum of its 72 absolute element differences equal to 34 and no adjacent elements equal.at n=14A234927
- a(n) = A000196(A277699(A277807(n))).at n=12A277806
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 435", based on the 5-celled von Neumann neighborhood.at n=14A288295
- Number of 5-cycles in the n X n king graph.at n=21A288919
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A317225
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A317230
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=52A317230
- a(n) = 2*1 + 4*3 + 6*5 + 8*7 + 10*9 + 12*11 + ... + (up to the n-th term).at n=44A319866
- Numbers m such that m*(m-tau(m))/sigma(m) is an integer h where k-tau(k) is the number of nondivisors of k (A049820) and sigma(k) is the sum of the divisors of k (A000203).at n=37A325020
- a(1) = 1; a(n) = Sum_{d|n, d < n} phi(n/d) * a(d)^2.at n=43A332778