14534
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24156
- Proper Divisor Sum (Aliquot Sum)
- 9622
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6552
- Möbius Function
- 0
- Radical
- 1118
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=39A034076
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.at n=30A073150
- a(n) = 2*n*(4*n-3).at n=43A139271
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149452
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=38A175356
- Coefficient of x^floor(n/2) in the expansion of (1+x+x^3)^n.at n=14A192440
- a(2) = 1, then (p-1)*(p-4)/2, with p = prime(n), n > 2.at n=38A200050
- Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=10A251889
- Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 2 3 6 or 7.at n=10A252259
- Number T(n,k) of permutations p of [n] such that min_{j=1..n} |p(j)-j| = k; triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=27A299789
- Expansion of Sum_{k>=1} mu(k)*log(1 + x^k/((1 - x^k)*(1 - 2*x^k)))/k.at n=17A308447
- Let t_k denote the triangular number k*(k+1)/2. Suppose 0 < x < y < z are integers satisfying t_x + t_y = t_p, t_y + t_z = t_q, t_x + t_z = t_r, for integers p,q,r. Sort the triples [x,y,z] first by x, then by y. Sequence gives the values of z.at n=42A332590
- Coefficient of x^n in the expansion of (1+x+x^3)^(2*n).at n=7A370185
- Triangle of generalized Stirling numbers of the lower level of the hierarchy (case m=2).at n=16A377058