14258
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21390
- Proper Divisor Sum (Aliquot Sum)
- 7132
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7128
- Möbius Function
- 1
- Radical
- 14258
- 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
- 120
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for Ni2In, Position Ni1 and In.at n=36A009941
- Coordination sequence for Ni2In, Position Ni2.at n=36A009942
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=36A010003
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=17A050791
- Ramanujan's c-series: expansion of (2+8*x-10*x^2)/(1-82*x-82*x^2+x^3).at n=2A051030
- a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.at n=13A074890
- Antidiagonal sums of rectangular table A124530.at n=9A124538
- 1-sequence of reduction of triangular number sequence by x^2 -> x+1.at n=11A192245
- Number of n X 7 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=2A202741
- T(n,k)=Number of nXk 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=38A202742
- Number of 3Xn 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=6A202744
- a(n) = A306912(n) - 2.at n=26A209489
- Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=28A254905
- Triangle read by rows: T(n,k) (n>=1, k>=0) is the number of posets with n elements and rank k (or depth k+1).at n=51A263859
- Number of n X 2 0..1 arrays with every element both equal and not equal to some elements at offset (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0), with upper left element zero.at n=9A278171
- Integer c such that (a^3 + b^3 - c^3)^2 = 1 where a,b,c are integers greater than 2.at n=35A281224
- G.f.: Sum_{n>=0} x^n * ((1+x)^n + sqrt(2)*i)^n / (1 + sqrt(2)*i*x*(1+x)^n)^(n+1), where i^2 = -1.at n=8A323682
- Number of nondecreasing sequences s1, s2, ..., s_n of powers of 2 such that s_i <= 1 + Sum_{j=1..i-1} s_j.at n=13A343756
- Irregular table read by rows, T(n, k) is the rank of the k-th Seidel permutation of {1,...,n}, permutations sorted in lexicographical order.at n=26A347600