14260
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32256
- Proper Divisor Sum (Aliquot Sum)
- 17996
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 7130
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 50
- 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
- Pisot sequence T(4,13), a(n) = floor(a(n-1)^2/a(n-2)).at n=7A010919
- a(n) = 3*a(n-1) + a(n-2) - a(n-3) - a(n-5).at n=7A022029
- McKay-Thompson series of class 44c for Monster.at n=54A058683
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=15A071393
- a(n) = Sum {k + j*m <= n} (k + j*m), with 0 < k,j,m <= n.at n=24A106847
- Expansion of chi(-q^5) / chi(-q)^5 in powers of q where chi() is a Ramanujan theta function.at n=12A132985
- 10 times pentagonal numbers: a(n) = 5*n*(3*n-1).at n=31A153780
- a(n) = 5^n + (1 - 4^n)/3.at n=6A155485
- Triangular array read by rows. The n-th row is the expansion of (1+x)(1+2x+4x^2)...(1+nx+(nx)^2+(nx)^3+...(nx)^n).at n=20A185588
- Number of ways to arrange 3 nonattacking triangular rooks on an nXnXn triangular grid.at n=10A193981
- 9-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0.at n=23A251751
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 195", based on the 5-celled von Neumann neighborhood.at n=27A270691
- Expansion of Sum_{i>=0} x^(2^i)/(1 - x^(2^i)) / Product_{j>=0} (1 - x^(2^j)).at n=47A281688
- Number of distinct topologies on an n-set that have exactly 9 open sets.at n=6A281777
- a(n) = 1 + Sum_{k=1..n} Sum_{d|k} mu(k/d)*p(d), where p(d) = number of partitions of d (A000041).at n=27A306912
- Area/6 of primitive Pythagorean triangles given in A334638 as triples.at n=3A334909
- The number of maximally large absolute-difference triangles consisting of positive integers <= n.at n=16A337719
- a(n) is the smallest number with exactly n divisors that are centered triangular numbers.at n=6A358544
- a(n) is the smallest centered triangular number divisible by exactly n centered triangular numbers.at n=6A359231
- Centered triangular numbers that are pseudoperfect (semiperfect).at n=5A377747