14292
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
- 18
- Divisor Sum
- 36218
- Proper Divisor Sum (Aliquot Sum)
- 21926
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 0
- Radical
- 2382
- Omega Function (Ω)
- 5
- 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
- 76
- 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 permutations of an n-sequence discordant with three given permutations (see reference) in n-6 places.at n=3A000492
- High temperature series for susceptibility for spherical model on f.c.c. lattice.at n=4A003495
- Matrix 6th power of partition triangle A008284.at n=57A050300
- Starting positions of strings of three 7's in the decimal expansion of Pi.at n=14A083631
- a(n) = ceiling(n^3/3).at n=35A131477
- Number of (w,x,y) with all terms in {0,...,n} and 2*w < |x+y-w|.at n=34A213396
- G.f. satisfies: A(x) = exp( Sum_{n>=1} x^n*A(x^n)/n / Product_{k>=1} (1 - x^(n*k)*A(x^n)^k) ).at n=8A219263
- G.f.: exp( Sum_{n>=1} A005064(n)*x^n/n ), where A005064(n) = sum of cubes of primes dividing n.at n=13A220427
- Number of nX6 0..3 arrays with exactly floor(nX6/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=2A222792
- T(n,k)=Number of nXk 0..3 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=30A222794
- Number of 3Xn 0..3 arrays with exactly floor(3Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=5A222796
- Squares of triangular numbers, written backwards.at n=17A229701
- Number of partitions of n with difference -9 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=38A242683
- Number of steps required to reach (2^n)-2 from 2^(n+1)-2 by iterating the map x -> x - (number of runs in binary representation of x).at n=16A255071
- Partial sums of A253089.at n=27A255601
- G.f.: Sum_{n=-oo..+oo} x^n * (1 + x^n)^n, an even function.at n=50A260361
- Number of steps needed when starting from (3^(n+1))-1 and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k) to encounter the first number whose base-3 representation begins with a digit other than 2.at n=11A261237
- Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 00100101 or 01010101.at n=7A261260
- G.f. satisfies: A(x) = (1+x)/(1-x) * A(x^2)*A(x^3)*A(x^4)*...*A(x^n)*... .at n=18A318767
- a(n) = n^(n-2) - Sum_{k=1..n-1} k^(k-2) * a(n-k).at n=6A332239