14192
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
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 27528
- Proper Divisor Sum (Aliquot Sum)
- 13336
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7088
- Möbius Function
- 0
- Radical
- 1774
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=33A047826
- a(n) equals floor(Vc(n) - Vs(n)), where Vc(n) is the volume of the cube with side length n and Vs(n) is the volume of the sphere of diameter n.at n=30A057671
- Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).at n=33A059680
- a(n) = |{m : multiplicative order of 10 mod m is equal to n}|.at n=47A059892
- a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).at n=34A081861
- Integers that do not appear in A103502.at n=5A103504
- Number of partitions of order n avoiding the consecutive pattern 231'1.at n=8A177476
- Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order.at n=41A222001
- Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k slices.at n=39A239894
- Numbers equal to the arithmetic derivative of their Euler totient function.at n=35A248815
- Number of length n+4 0..3 arrays with at most two downsteps in every 4 consecutive neighbor pairs.at n=2A255656
- T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=17A255660
- Number of length n+3 0..3 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=3A255663
- G.f. satisfies A(x) = 1 + x/(1 - x^3)^2 * A(x/(1 - x^3)).at n=15A360892
- E.g.f. satisfies A(x) = exp( 2*x*A(x) / (1+x) ).at n=5A361213
- E.g.f. A(x) satisfies A(x) = exp( 2 * x * (1 + x * A(x)^(1/2))^2 ).at n=5A372202
- Number of solutions to the n-queens puzzle in a n X n board that are not square root permutations of {n-1,...,2,1,0}.at n=11A383738